SPADE: An efficient algorithm for mining frequent sequences

Mohammed J. Zaki

Research output: Contribution to journalArticle

1253 Citations (Scopus)

Abstract

In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex hash structures which have poor locality. SPADE utilizes combinatorial properties to decompose the original problem into smaller sub-problems, that can be independently solved in main-memory using efficient lattice search techniques, and using simple join operations. All sequences are discovered in only three database scans. Experiments show that SPADE outperforms the best previous algorithm by a factor of two, and by an order of magnitude with some pre-processed data. It also has linear scalability with respect to the number of input-sequences, and a number of other database parameters. Finally, we discuss how the results of sequence mining can be applied in a real application domain.

Original languageEnglish
Pages (from-to)31-60
Number of pages30
JournalMachine Learning
Volume42
Issue number1-2
DOIs
Publication statusPublished - 29 Sep 2001

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Cite this