Journal
MACHINE LEARNING
Volume 42, Issue 1-2, Pages 31-60Publisher
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1007652502315
Keywords
sequence mining; sequential patterns; frequent patterns; data mining; knowledge discovery
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available