Differences

This shows you the differences between two versions of the page.

--- sequential_pattern_mining [2021/06/21 11:22]
philfv
+++ sequential_pattern_mining [2022/02/11 07:33] (current)
philfv [Algorithms]
@@ Line 40: / Line 40: @@
 Numerous algorithms have been designed for sequential pattern mining. But most of them are inspired by one of the following classic algorithms: **SPAM**, **SPADE**, **PrefixSpan**, **GSP**, **CM-SPAM **and **CM-SPADE**.
+   * **GSP**: R. Agrawal, and R. Srikant, Mining sequential patterns, ICDE 1995, pp. 3–14, 1995.
+  * **SPAM**: Ayres, J. Flannick, J. Gehrke, and T. Yiu, Sequential pattern mining using a bitmap representation, KDD 2002, pp. 429–435, 2002.
+  * **SPADE**: M. J. Zaki, SPADE: An efficient algorithm for mining frequent sequences, Machine learning, vol. 42(1-2), pp. 31–60, 2001.
+  * **PrefixSpan:**  J. Pei, et al. Mining sequential patterns by pattern-growth: The prefixspan approach, IEEE Transactions on knowledge and data engineering, vol. 16(11), pp. 1424–1440, 2004.
+  * **CM-SPAM and CM-SPADE**: P. Fournier-Viger, A. Gomariz, M. Campos, and R. Thomas, Fast Vertical Mining of Sequential Patterns Using Co-occurrence Information, PAKDD 2014, pp. 40–52, 2014.
 ===== Survey papers =====

The Pattern Mining Wiki