作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (19): 69-71. doi: 10.3969/j.issn.1000-3428.2007.19.024

• 软件技术与数据库 • 上一篇    下一篇

一种基于前缀树的增量序列挖掘算法

张 坤,陈 越,朱扬勇   

  1. (复旦大学计算机与信息技术系,上海 200433)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-10-05 发布日期:2007-10-05

Incremental Sequence Mining Algorithm Based on Prefix-tree

ZHANG Kun, CHEN Yue, ZHU Yang-yong   

  1. (Department of Computer and Information Technology, Fudan University, Shanghai 200433)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-05 Published:2007-10-05

摘要: 在已有模式的基础上,该文挖掘出了新的模式,减少了挖掘原始数据库次数,指出了IncSpan+算法存在的问题,说明了基于半频繁模式的增量挖掘算法的缺陷,提出了一种增量序列模式挖掘算法。该算法构造了前缀树表示序列模式,并用广度剪枝和深度剪枝维护该前缀树的结构。实验表明,该算法具有良好的性能。

关键词: 增量序列模式挖掘, 广度剪枝, 深度剪枝, 前缀树

Abstract: Based on existed models, this paper proposes a new one that can reduce checking times of the original database, and points out problems in IncSpan+ and defects in interpret mining based on semi-frequent patterns. It constructs a prefix tree to represent the sequence patterns, and continuously maintains the tree structure by using width pruning and depth pruning. Experimental results show the algorithm has a good performance.

Key words: incremental sequence pattern mining, width pruning, depth pruning, prefix-tree

中图分类号: