文章詳目資料

資管評論

  • 加入收藏
  • 下載文章
篇名 以可重複序列挖掘網路瀏覽規則之研究
卷期 9
並列篇名 Mining Web Traversal Rules with Sequences
作者 陳仕昇許秉瑜陳彥良
頁次 53-71
關鍵字 資料挖掘樣式關聯規則序列式資料Data miningPatternAssociation ruleSequence data
出刊日期 199912

中文摘要

     網頁瀏覽過程中的許多資料,如能適當的整理,應可幫忙了解使用者的瀏覽行為。而了解瀏覽者的行為不僅可幫系統預取所需網頁,並可幫系統業者決定在那些網頁上刊登廣告,也可替proxy server制定較佳的資料更新策略,減少使用者在瀏覽網頁的等待時間。在本篇論文中我們利用資料挖礦技術來建立使用者瀏覽關聯規則,以了解使用者的瀏覽行徑,與先前研究不同的是為能了解使用者瀏覽順序,此關聯規則是建立在序列的資料結構上並且將發現的關聯規則分成前溯型及後推型兩種;為了解決序列獨特的重複問題,此論文設計了特別的門檻值計算方法;為了解決門檻值與序列長度成反向成長的問題,此論文設計了Next Pass Large Threshold及Next Pass Large Sequence。

英文摘要

     Web traversal patterns and rules are valuable to both Electronic Commerceand System Designers. If business owners know users' traversal behaviors, they canput advertisement banners in proper web pages with proper order. The sameinformation can help systems to pre-fetch web pages and reduce response time. In thisarticle, we propose a new data mining method to find the traversal patterns andassociated rules. Traversal patterns are recorded in sequences, which have total ordersamong their elements. Sequences may have duplicated elements, and hence requires anew threshold computing method. The new method results in thresholds decreasingwhen sequences expanding. To resolve the issue, we design Next Pass LargeThreshold and Next Pass Large Sequences to forecast needed sequences andthresholds. To expand sequences properly, sequence join, instead of traditional set joinis employed. Since sequences contain orders, the rules established include forwardreasoning and backward reasoning. Forward reasoning asserts rules in the order ofevent happening. Backward reasoning, on the other hand, asserts the rules in thereversed order. Both rules are valuable to EC and system designers.

相關文獻