2012 IEEE International Conference on Granular Computing (2012)
Hangzhou, China China
Aug. 11, 2012 to Aug. 13, 2012
Jia-Ching Ying , Institute of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C.
Chu-Yu Chin , Institute of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C.
Vincent S. Tseng , Institute of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C.
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.
Navigation, Design automation, Barium, Argon, Equations, Navigation prediction, Web mining, Incremental mining, Web navigation pattern
J. Ying, C. Chin and V. S. Tseng, "Mining web navigation patterns with dynamic thresholds for navigation prediction," 2012 IEEE International Conference on Granular Computing(GRC), Hangzhou, China China, 2012, pp. 614-619.