2001 SPADEAnEfficientAlgorithmforMin
- (Zaki, 2001) ⇒ Mohammed J. Zaki. (2001). “SPADE: An Efficient Algorithm for Mining Frequent Sequences.” In: Machine Learning Journal, 42(1-2). doi:10.1023/A:1007652502315
Subject Headings: Frequent Pattern Mining, Sequential Pattern Mining.
Notes
Cited By
- http://scholar.google.com/scholar?q=%22SPADE%3A+An+Efficient+Algorithm+for+Mining+Frequent+Sequences%22+2001
- http://dl.acm.org/citation.cfm?id=599609.599626&preflayout=flat#citedby
Quotes
Author Keywords
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.
References
,
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 2001 SPADEAnEfficientAlgorithmforMin | Mohammed J. Zaki | SPADE: An Efficient Algorithm for Mining Frequent Sequences | 10.1023/A:1007652502315 | 2001 |