AN EFFICIENT MINING MAXIMAL FREQUENT TRAVERSAL SEQUENCES ALGORITHM BASED ON BIDIRECTIONAL CONSTRAINT
Mining maximal frequent traversal sequence is a crucial application in web usage mining, since users traversal pattern and motivation are latent in session sequence at some time segment. A Frequent Traversal Sequence Tree structure with Dwell time (FTSD-Tree) is designed. Utilizing FTSD-Tree to store, compress the session database that is constrained by the bidirectional dwell time, and simplify the configuration of dwell time thresholds during mining. A novel algorithm named Maximal Frequent Traversal Sequence Mining (MFTSM) is presented, which quickly traverses FTSD-Tree and discovers maximal frequent traversal sequence from the session sequences. Experimental results show that MFTSM can significantly improve the execution time efficiency for mining maximal frequent traversal sequence as long as the decision-makers or users give the appropriate constraints. Our performance study at runtime shows that MFTSM is faster than the well-known algorithms GSP, SPAM, MSPS and SPADE in the time constraint environment.
Dwell time FTSD-Tree Maximal frequent traversal sequence
JIA-DONG REN XIAO-JIAN ZHANG HUI-LI PENG
College of Information Science and Engineering, YanShan University, Qinhuangdao 066004, China
国际会议
2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)
大连
英文
1575-1580
2006-08-13（万方平台首次上网日期，不代表论文的发表时间）