GO-SPADE: Mining sequential patterns over datasets with consecutive repetitions

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2734, Issue , 2003, Pages 293-306

  Leleu, Marion ^a,b   Rigotti, Christophe ^a   Boulicaut, Jean François ^a   Euvrard, Guillaume ^b  

^a UNIVERSITÉ DE LYON   (France)

^b Dir de la Strategie Info CDC   (France)

Author keywords

Frequent sequential pattern mining; Generalized occurrences; SPADE

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATABASE SYSTEMS; GRAPH THEORY; MATHEMATICAL OPERATORS; SET THEORY; ARTIFICIAL INTELLIGENCE; DATA MINING; LEARNING SYSTEMS;

DATASETS; FREQUENT SEQUENTIAL PATTERN MINING; GENERALIZED OCCURENCES; SPADE; FREQUENT SEQUENTIAL PATTERNS; GENERALIZED OCCURRENCES; ITS EFFICIENCIES; MINING SEQUENTIAL PATTERNS; PRIMITIVE OPERATOR; QUANTITATIVE VALUES;

DATA MINING; PATTERN RECOGNITION;

EID: 8344289173     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45065-3_26     Document Type: Conference Paper

References (14)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the VLDB Conference, Santiago, Chile, September 1994.
2. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. of the 11th International Conference on Data Engineering (ICDE'95), pages 3-14, Taipei, Taiwan, March 1995. IEEE Computer Society.
3. G. Das, L. K.I., H. Mannila, G. Renganathan, and P. Padhraic Smyth. Rule discovery from time series. In Proc. of the 4th International Conference on Knowledge Discovery and Data Mining (KDD'98), pages 16-22, New York (USA), August 1998. AAAI Press.
4. J. Han, J. Pei, B. Han Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. Freespan: Frequent pattern-projected sequential pattern mining. In Proc. 2000 Int. Conf. Knowledge Discovery and Data Mining (KDD'00), pages 355-359, August 2000.
5. M. Leleu and J. Boulicaut. Signing stock market situations by means of characteristic sequential patterns. In Proc. of the 3rd International Conference on Data Mining (DM'02), Bologna, Italy, September 2002. WIT Press.
6. H. Mannila, H. Toivonen, and A. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3):259-298, November 1997.
7. F. Masseglia, C. F., and P. P. The PSP approach for mining sequential patterns. In Proc. of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery in Databases (PKDD'98), pages 176-184, Nantes, France, September 1998. Lecture Notes in Artificial Intelligence, Springer Verlag.
8. J. Pei, B. Han, B. Mortazavi-Asl, and H. Pinto. Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. of the 17th International Conference on Data Engineering (ICDE'01), 2001.
9. J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 21-30, May 2000.
10. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Proc. of the 5th International Conference on Extending Database Technology (EDBT'96), pages 3-17, Avignon, France, September 1996.
11. M. Zaki. Efficient enumeration of frequent sequences. In Proc. of the 7th International Conference on Information and Knowledge Management (CIKM'98), pages 68-75, November 1998.
12. M. Zaki. Sequence mining in categorical domains: incorporating constraints. In Proc. of the 9th International Conference on Information and Knowledge Management (CIKM'00), pages 422-429, Washington, DC, USA, November 2000.
13. M. Zaki. Spade: an efficient algorithm for mining frequent sequences. Machine Learning, Special issue on Unsupervised Learning, 42(1/2):31-60, Jan/Feb 2001.
14. M. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In Proc. of the 2nd SIAM International Conference on Data Mining, Arlington, Virginia, USA, April 2002.