改进的FLWAP的Web访问序列模式挖掘方法  

Improved Mining Method for FLWAP on Web Access Sequential Pattern

作　　者：王海波[1] 陈志国[1] 徐一秋[1] 李朋轩[2] 

机构地区：[1]牡丹江医学院教育技术与信息中心,黑龙江牡丹江157011 [2]阿里巴巴(中国)网络技术有限公司,浙江杭州310099

出　　处：《计算机与现代化》2011年第3期17-20,共4页Computer and Modernization

摘　　要：为了提高序列模式挖掘的FLWAP-mine算法挖掘海量数据的效率和性能,基于减少数据库访问次数原则和序列模式的Apriori性质对FLWAP-mine算法进行改进,构造FLWAP-tree过程中只扫描一次访问序列数据库,对树进行剪枝删除非频繁事件。模式挖掘过程中采取投影数据库思想,只搜索当前模式的投影树,对构造的投影树判断剪枝,去除非频繁事件,进一步缩小搜索范围。实验表明,当数据量较大或支持度阈值较小时,改进的FLWAP-mine算法比FLWAP-mine算法有更好的性能。In order to improve the efficiency and performance of mass data mining for FLWAP-mine algorithm,based on reducing the time of scanning the database and the Apriori properties of sequential pattern,the FLWAP-mine algorithm is improved.It constructs the projection tree by scanning the database once,and then deletes the non-frequent events from the projection tree by pruning.The improved FLWAP-mine algorithm adopts the idea of the projection tree to search the projection tree of the current pattern,reduces the search area by pruning the projection tree.The experimental results show that the improved FLWAP-mine algorithm performs better than the previous one when the data set is large or the minimum support threshold is small.

关 键 词：序列模式 FLWAP-mine 投影树 剪枝 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]