An efficient technique for mining approximately frequent substring patterns

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 325-330

  Ji, Xiaonan ^a   Bailey, James ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; MINERS; NUCLEIC ACIDS; ORGANIC ACIDS; SEARCH ENGINES; STANDARDS;

APPLICATIONS.; DATA-SETS; INTERNATIONAL CONFERENCES; PATTERN QUALITY; REAL-WORLD; SEQUENTIAL PATTERN MINING ALGORITHMS; SEQUENTIAL PATTERNS; SUB-STRINGS;

MINING;

EID: 49549124209     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2007.121     Document Type: Conference Paper

References (14)

1. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. of IEEE ICDE, pages 3-14, 1995.
2. H. Arimura, H. Asaka, H. Sakamoto, and S. Arikawa. Efficient discovery of proximity patterns with suffix arrays. In Proc. Comb. Pattern Matching, pages 152-156, 2001.
3. M. Capelle, C. Masson, and J. F. Boulicaut. Mining frequent sequential patterns under a similarity constraint. In Proc. of IDEAL, pages 1-6, 2002.
4. S. Chan, B. Kao, C. L. Yip, and M. Tang. Mining emerging substrings. In Proc. of DASFAA, 2003.
5. S. Dan Lee and L. De Raedt. An efficient algorithm for mining string databases under constraints. In Proceedings of KDID, pages 108-129, 2004.
6. J. Fischer, V. Heun, and S. Kramer. Fast frequent string mining using suffix arrays. In Proc. of IEEE ICDM, pages 609-612, 2005.
7. X. Ji, J. Bailey, and G. Dong. Mining minimal distinguishing subsequence patterns with gap constraints. In Proc. of IEEE ICDM, pages 194-201, 2005.
8. H. Kum, J. Pei, W. Wang, and D. Duncan. Approxmap: Approximate mining of consensus sequential patterns. In Proc. of SDM, 2003.
9. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu. Prefixspan: Mining sequential patterns by prefix-projected growth. In Proc. of IEEE ICDE, pages 215-224, 2001.
10. J. Pei, J. Han, and W. Wang. Mining sequential patterns with constraints in large databases. In Proc. of CIKM, pages 18-25, 2002.
11. M. F. Sagot. Spelling approximate repeated or common motifs using a suffix tree. In Proc. of LATIN, pages 374-390, 1998.
12. J. Wang and J. Han. BIDE: Efficient mining of frequent closed sequences. In Proc. of ICDE, pages 79-90, 2004.
13. X. Yan, J. Han, and R. Afshar. Clospan: Mining closed sequential patterns in large databases. In Proc. of SDM., 2003.
14. M. J. Zaki. Sequence mining in categorical domains: In-corporating constraints. In Proc. of CIKM, pages 422-429, 2000.