Efficient discovery of frequent approximate sequential patterns

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 751-756

  Zhu, Feida ^a   Yan, Xifeng ^b   Han, Jiawei ^a   Yu, Philip S ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKS; EFFICIENT ALGORITHMS; EXPERIMENTAL STUDIES; FREQUENT PATTERNS; GLOBAL SEARCH; INCREMENTAL GROWTH; INTERNATIONAL CONFERENCES; LOCAL SEARCH; SALIENT FEATURES; SEQUENTIAL PATTERNS;

ADMINISTRATIVE DATA PROCESSING; ALGORITHMS; DATA MINING; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; MINING; SEARCH ENGINES; SEQUENTIAL SWITCHING;

ITERATIVE METHODS;

EID: 49749097886     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.75     Document Type: Conference Paper

References (18)

1. R. Agrawal and R. Srikant. Mining sequential patterns. In ICDE'95, pages 3-14.
2. J. Ayres, J. Flannick, J. E. Gehrke, and T. Yiu. Sequential pattern mining using bitmap representation. In KDD'02, pages 429-435.
3. C. Bettini, X. S. Wang, and S. Jajodia. Mining temporal relationships with multiple granularities in time sequences. Bull. Technical Committee on Data Engineering, 21:32-38, 1998.
4. M. Garofalakis, R. Rastogi, and K. Shim. SPIRIT: Sequential pattern mining with regular expression constraints. In VLDB'99, pages 223-234.
5. D. Gusfield. Algorithms on Strings, Trees and Sequences, Computer Science and Computation Biology. Cambridge University Press, 1997.
6. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series database. In ICDE'99, pages 106-115.
7. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. FreeSpan: Frequent pattern-projected sequential pattern mining. In KDD'00, pages 355-359.
8. H.-C. Kum, J. Pei, W. Wang, and D. Duncan. Ap-proxMap: Approximate mining of consensus sequential patterns. In SDM'03.
9. S. Kurtz, J. Choudhuri, E. Ohlebusch, C. Schleier-macher, J. Stoye, and R. Giegerich. Reputer: The manifold applications of repeat analysis on a genomic scale. In Nucleic Acids Research, number 22, pages 4633-4642, 2001.
10. G. M. Landau and J. P. Schmidt. An algorithm for approximate tandem repeats. In Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, number 684, pages 120-133,1993.
11. F. Masseglia, F. Cathala, and P. Poncelet. The PSP approach for mining sequential patterns. In PKDD'98, pages 176-184.
12. Institute for Systems Biology. Repeatmasker. In http://www.repeatmasker. org/webrepeatmasker-help.html, 2003.
13. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE'01, pages 215-224.
14. J. Pei, J. Han, and W. Wang. Constraint-based sequential pattern mining in large databases. In CIKM'02, pages 18-25.
15. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In EDBT'96, pages 3-17.
16. J. Wang and J. Han. BIDE: Efficient mining of frequent closed sequences. In ICDE'04, pages 79-90.
17. X. Yan, J. Han, and R. Afshar. CloSpan: Mining closed sequential patterns in large datasets. In SDM'03, pages 166-177.
18. M. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 40:31-60, 2001.