基于改进的AprioriAll算法的Web序列模式挖掘研究.pdfVIP

计算机工程与设计 Computer Engineering and Design ( ) 吴海燕，朱靖君，高国柱，等：基于改进的AprioriAll 算法的Web 序列模式挖掘研究 2010,31 5 92 1 信息化技术 基于改进的AprioriAll 算法的Web 序列模式挖掘研究 吴海燕， 朱靖君， 高国柱， 程志锐 ( 清华大学计算机与信息管理中心，北京 100084) 摘 要：为了减少AprioriAll 算法挖掘过程中候选序列的生成以及对序列数据库的扫描次数，提高算法的挖掘效率，提出了 一种基于改进的AprioriAll 算法的Web 序列模式挖掘方法。首先对数据进行预处理，然后利用经过改进的AprioriAll 算法进 行模式挖掘。算法的改进主要有两点：一个通过改变候选序列的连接方式来减少候选序列的产生；二是通过减少不必要的 数据库扫描操作来提高算法的效率。通过实验验证了改进后算法在Web 序列模式挖掘过程中的高效性和正确性。 关键词：AprioriAll 算法; 序列模式; Web 日志挖掘; 事务; 最大向前路径 中图法分类号：TP311 文献标识码：A 文章编号：1000-7024 (2010) 05-092 1-04 Research of web sequential pattern mining based on improved AprioriAll algorithm WU Hai-yan, ZHU Jing-jun, GAO Guo-zhu, CHENG Zhi-rui (Computer and Information Management Center, Tsinghua University, Beij ing 100084, China) Abstract ：To reduce the generation of candidate sequences and the scans to sequence database for AprioriAll algorithm, an efficient se- quential pattern mining method based on improved AprioriAll algorithm is presented. Firstly, data are preprocessed. Then the sequential pattern mining is finished by improved AprioriAll algorithm. The improvements of AprioriAll algorithm are mainly two points: one is to change the connection of candidate sequences to reduce the generation of candidate sequences; the other is to reduce the needless data- base scans to improve the efficiency of algorithm. Finally, the efficiency and validity of improved AprioriAll algorithm is validated by experiments. Key words ：AprioriAll algorithm; sequential pattern; web log mining; transaction; maximal forward path [ ]