By Topic

An Efficient Mining Maximal Frequent Traversal Sequences Algorithm Based on Bidirectional Constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jia-dong Ren ; College of Information Science and Engineering, YanShan University, Qinhuangdao 066004, China. E-MAIL: jdren@ysu.edu.cn ; Xiao-jian Zhang ; Hui-li Peng

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

Published in:

2006 International Conference on Machine Learning and Cybernetics

Date of Conference:

13-16 Aug. 2006