Incremental mining of sequential patterns using prefix tree

  • Authors:
  • Yue Chen;Jiankui Guo;Yaqin Wang;Yun Xiong;Yangyong Zhu

  • Affiliations:
  • Department of Computing and Information Technology, Fudan University, Shanghai, China and Computer Science and Technology School, Soochow University, Suzhou, China;Department of Computing and Information Technology, Fudan University, Shanghai, China;Department of Computing and Information Technology, Fudan University, Shanghai, China and Computer Science and Technology School, Soochow University, Suzhou, China;Department of Computing and Information Technology, Fudan University, Shanghai, China;Department of Computing and Information Technology, Fudan University, Shanghai, China

  • Venue:
  • PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper fist demonstrates that current PrefixSpan-based incremental mining algorithm IncSpan+ which is proposed in PAKDD05 cannot completely mine all sequential patterns. Then a new incremental mining algorithm of sequential patterns using prefix tree is proposed. This algorithm constructs a prefix tree to represent the sequential patterns, and then continuously scans the incremental element set to maintain the tree structure, using width pruning and depth pruning to eliminate the search space. The experiment shows this algorithm has a good performance.