Mining web navigation patterns with dynamic thresholds for navigation prediction

Jia Ching Ying*, Chu Yu Chin, Vincent Shin-Mu Tseng

*此作品的通信作者

研究成果: Conference contribution同行評審

2 引文 斯高帕斯(Scopus)

摘要

Discovering web navigation patterns is an important issue in web usage mining with various applications like navigation prediction and improvement of website management. Since web site structure is always changed, we need not only consider the frequency of click behavior but also web site structure to mine web navigation patterns for navigation prediction. To reduce the overhead of dynamically mining the web navigation patterns from the web data, a dynamic mining approach is needed by using the previous mining results and computing new patterns just from the inserted or deleted part of the web data. In this paper, we propose a special data structure named Ideal-Tree (Inverted-data-base Expectable Tree) to avoid the effort of scanning database. Meanwhile, an efficient mining algorithm named Ideal-Tree-Miner is proposed for mining web navigation patterns with dynamic thresholds. Based on the discovered patterns, we also give a navigation prediction model. The experimental results show that our prediction model outperforms other approaches substantially in terms of Precision, Recall, and F-measure.

原文English
主出版物標題Proceedings - 2012 IEEE International Conference on Granular Computing, GrC 2012
頁面614-619
頁數6
DOIs
出版狀態Published - 1 12月 2012
事件2012 IEEE International Conference on Granular Computing, GrC 2012 - HangZhou, 中國
持續時間: 11 8月 201213 8月 2012

出版系列

名字Proceedings - 2012 IEEE International Conference on Granular Computing, GrC 2012

Conference

Conference2012 IEEE International Conference on Granular Computing, GrC 2012
國家/地區中國
城市HangZhou
期間11/08/1213/08/12

指紋

深入研究「Mining web navigation patterns with dynamic thresholds for navigation prediction」主題。共同形成了獨特的指紋。

引用此