TY - GEN
T1 - Mining web navigation patterns with dynamic thresholds for navigation prediction
AU - Ying, Jia Ching
AU - Chin, Chu Yu
AU - Tseng, Vincent Shin-Mu
PY - 2012/12/1
Y1 - 2012/12/1
N2 - 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.
AB - 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.
KW - Incremental mining
KW - Navigation prediction
KW - Web mining
KW - Web navigation pattern
UR - http://www.scopus.com/inward/record.url?scp=84875044180&partnerID=8YFLogxK
U2 - 10.1109/GrC.2012.6468696
DO - 10.1109/GrC.2012.6468696
M3 - Conference contribution
AN - SCOPUS:84875044180
SN - 9781467323109
SN - 9781467323116
T3 - Proceedings - 2012 IEEE International Conference on Granular Computing, GrC 2012
SP - 614
EP - 619
BT - Proceedings - 2012 IEEE International Conference on Granular Computing, GrC 2012
T2 - 2012 IEEE International Conference on Granular Computing, GrC 2012
Y2 - 11 August 2012 through 13 August 2012
ER -