首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于PrefixSpan思想的增量时序模式挖掘算法
引用本文:熊学栋,肖建华.基于PrefixSpan思想的增量时序模式挖掘算法[J].湖南第一师范学报,2007,7(2):158-160.
作者姓名:熊学栋  肖建华
作者单位:1. 湘潭大学信息工程学院,湖南,湘潭,411105
2. 湖南省第一师范学校信息技术系,湖南,长沙,410002
摘    要:基于PrefixSpan思想的序列模式增量挖掘算法,对更新数据库的频繁模式分三类进行挖掘,利用了原频繁模式基的信息,对局部新增数据进行挖掘,只在候选集的处理中对更新数据库扫描一次。实验表明,该方法与直接用PrefixSpan算法对更新数据库挖掘相比,性能上有较大的提高。

关 键 词:增量挖掘  PrefixSpan  投影数据  序列模式
文章编号:1671-4369(2007)02-0158-03
修稿时间:2007-03-15

Incremental Sequential Pattern Mining Algorithm Based on PrefixSpan Methodology
XIONG Xue-dong,XIAO Jian-hua.Incremental Sequential Pattern Mining Algorithm Based on PrefixSpan Methodology[J].Journal of First Teachers College of Hunan,2007,7(2):158-160.
Authors:XIONG Xue-dong  XIAO Jian-hua
Institution:1. College of Information and Engineering, Xiangtan University, Xiangtan, Hunan 411105 ; 2. Department of Information Technology, Hunan First Normal College, Changsha, Hunan 410001
Abstract:This paper proposes an incremental mining algorithm for mining time evolved sequential database by classifying the targeted patterns into three sub-classes.It is based on the well-known PrefixSpan methodology,mining only on the incremented data while only scan the updated database only once to get the qualified patterns.The experiment shows that it is a wise choice comparing to mining the whole updated database from scratch.
Keywords:incremental mining  PrefixSpan  projection database  sequential pattern
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号