Improvements of incspan: incremental mining of sequential patterns in large database

  • Authors:
  • Son N. Nguyen;Xingzhi Sun;Maria E. Orlowska

  • Affiliations:
  • School of Information Technology and Electrical Engineering, The University of Queensland, QLD, Australia;School of Information Technology and Electrical Engineering, The University of Queensland, QLD, Australia;School of Information Technology and Electrical Engineering, The University of Queensland, QLD, Australia

  • Venue:
  • PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In reality, sequence databases are updated incrementally. The changes on the database may invalidate some existing sequential patterns and introduce new ones. Instead of recomputing the database each time, the incremental mining algorithms target efficiently maintaining the sequential patterns in the dynamically changing database. Recently, a new incremental mining algorithm, called IncSpan was proposed at the International Conference on Knowledge Discovery and Data Mining (KDD'04). However, we find that in general, IncSpan fails to mine the complete set of sequential patterns from an updated database. In this paper, we clarify this weakness by proving the incorrectness of the basic properties in the IncSpan algorithm. Also, we rectify the observed shortcomings by giving our solution.