基于改进的Wap算法的Web序列模式的研究  

Research on the Web Sequence Pattern Based on the Improved Wap Algorithm

作　　者：王慧[1] 张骏温[1] 

机构地区：[1]北京交通大学计算机与信息技术学院,北京100044

出　　处：《计算机科学》2012年第2期206-208,239,共4页Computer Science

基　　金：核高基重大专项项目(2009ZX01045-005-001)资助

摘　　要：序列模式挖掘是Web日志挖掘中的一个重要范畴。针对Wap算法中递归构建大量条件树的这一缺陷,提出了一种改进算法NGCWAP。NGCWAP算法采用前序遍历号和后序遍历号来跟踪频繁序列分布在哪些后缀树集中,避免了条件树的构建,从而减少了内存消耗。通过实验验证了改进算法的正确性和高效性。Sequential pattern mining is an important mining area of the Web log mining.Wap algorithm must construct a large number of conditional trees during mining,so this paper proposed an improved algorithm which name is NGCWAP to solve that problem.The NGCWAP algorithm uses the pre-order traversal number and post-order traversal number to trace the sub-trees in which candidates are located,which avoids construction of the conditional tree,thus the algorithm reduces memory consumption.The experiment results show accuracy and efficiency of the improved algorithm.

关 键 词：数据挖掘 WEB日志挖掘 Wap算法 频繁序列 

分 类 号：TP313.13[自动化与计算机技术—计算机软件与理论]