时序关系下的闭合序列模式挖掘算法  

A Closed Sequential Pattern Mining Algorithm in Time Order

作　　者：付宇[1] 于艳华[1] 宋美娜[1] 战晓苏[2] 

机构地区：[1]北京邮电大学PCN&CAD中心,北京100876 [2]军事科学院军事运筹分析研究所,北京100876

出　　处：《北京邮电大学学报》2013年第4期19-22,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家科技支撑计划项目(2012BAH01F02;2013BAH10F01;2013BAH07F02);国家自然科学基金项目(61072060);国家高技术研究发展计划项目(2011AA100706);高等学校博士学科点专项科研基金项目(20110005120007);中央高校基本科研业务费专项资金和教育部信息网络工程研究中心项目

摘　　要：序列挖掘算法产生冗余序列,造成其运行时间过长.对此,提出了一种新的闭合序列挖掘算法——时序关系下的闭合序列模式挖掘算法.依据闭合序列模式的性质,通过比较频繁序列与每个1-项频繁序列之间的时序关系,推断频繁序列模式是否可扩展.基于IBM公司的合成数据,将其与闭合序列模式挖掘算法进行比较,实验结果表明,这种新的闭合序列挖掘算法可以有效降低运行时间且不易受到属性值个数的影响.Since there exist redundant sequential patterns in results, such mining runs for a long time. To combat this drawback, a new algorithm, called closed sequential patterns mining algorithm in time order （CloTSP） ,is proposed. Based on the nature of closed sequential patterns, CloTSP can judge whether a frequent sequential pattern is extended by comparing its time order with each frequent 1-item subse- quence. Experiments on the synthetic data produced by International business machines corporation se- quential pattern generator show that CloTSP can shorten run-time significantly compared to closed sequen- tial pattern mining （CloSpan）. Furthermore, it is also shown that the run-time of CloTSP is not affected by variation of attribute numbers.

关 键 词：时序关系 闭合序列模式 数据挖掘 

分 类 号：TN929.53[电子电信—通信与信息系统]