基于改进PrefixSpan的序列模式挖掘算法  

Sequential patterns mining algorithm based on improved PrefixSpan

作　　者：公伟[1,2] 刘培玉[1,2] 贾娴[1,2] 

机构地区：[1]山东师范大学信息科学与工程学院,济南250014 [2]山东省分布式计算机软件新技术重点实验室,济南250014

出　　处：《计算机应用》2011年第9期2405-2407,共3页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60873247);山东省高新自主创新专项工程资助项目(2008ZZ28);山东省自然科学基金资助项目(ZR2009GZ007);山东省教育厅科技计划项目(J09LG52)

摘　　要：针对PrefixSpan算法构造投影数据库开销大的问题,提出一种基于改进PrefixSpan的序列模式挖掘算法SPMIP。该方法通过添加剪枝步和减少某些特定序列模式生成过程的扫描,来减少投影数据库的规模及扫描投影数据库的时间,提高算法效率,并最终得到需要的序列模式。实验结果证明在获得序列模式不受影响情况下,SPMIP算法比PrefixSpan算法效率更高。PrefixSpan, the classic sequential patterns mining algorithm, has the problem of producing huge amount of project databases. To solve this problem, a sequential patterns mining algorithm named SPMIP was proposed based on an improved PrefixSpan. This algorithm reduced the scale of projected databases and the time of scanning projected databases through adding pruning step and reducing scanning of certain specific sequential patterns production. In this way, algorithm efficiency could be raised up, and the needed sequential patterns were obtained. The experimental results show that SPMIP is more efficient than PrefixSpan while obtained sequential patterns have not been affected.

关 键 词：PREFIXSPAN 序列模式 投影数据库 剪枝 扫描 

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