Sequential pattern mining with wildcards

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 1, Issue , 2010, Pages 241-247

  Xie, Fei ^a,c   Wu, Xindong ^a,b   Hu, Xuegang ^a   Gao, Jun ^a   Guo, Dan ^a   Fei, Yulian ^d   Hua, Ertian ^d  

^a HEFEI UNIVERSITY OF TECHNOLOGY   (China)

^b UNIVERSITY OF VERMONT   (United States)

^c HEFEI NORMAL UNIVERSITY   (China)

^d ZHEJIANG GONGSHANG UNIVERSITY   (China)

Author keywords

Candidate occurrence pruning; Component; One off condition; Sequential pattern mining; Wildcard

Indexed keywords

CANDIDATE OCCURRENCE PRUNING; COMPONENT; ONE-OFF CONDITION; SEQUENTIAL-PATTERN MINING; WILDCARD;

ARTIFICIAL INTELLIGENCE;

DATA MINING;

EID: 78751471446     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2010.42     Document Type: Conference Paper

References (16)

1. R. Agrawal and R. Srikant, "Mining sequential patterns", in Proc. IEEE ICDE'95, Taipei, Taiwan, Mar. 1995, pp. 3-14.
2. J. Ayres, J. Gehrke, T. Yiu, and J. Flannick, "Sequential pattern mining using a bitmap representation", in Proc. ACM SIGKDD'02, Edmonton, Alberta, Canada, July 2002, pp. 429-435.
3. A. van Belkum, S. Scherer, W. van Leeuwen, D. Willemse, L. van Alphen, and H. Verbrugh, "Variable number of tandem repeats in clinical strains of haemophilus influenzae", Infection and Immunity, vol. 65, no. 12, pp. 5017-5027, 1997.
4. G. Chen, X. Wu, X. Zhu, A. Arslan, and Y. He, "Efficient string matching with wildcards and length constraints", Knowledge and Information System, vol. 10, no. 4, pp. 399-419, 2006.
5. B. Ding, D. Lo, J. Han, and S. C. Khoo, "Efficient mining of closed repetitive gapped subsequences from a sequence database", in Proc. IEEE ICDE'09, Shanghai, China, Mar. 2009, pp. 1024-1035.
6. Y. He, X. Wu, X. Zhu, and A. N. Arslan, "Mining frequent patterns with wildcards from biological sequences", in Proc. IEEE IRI'07, Las Vegas, USA, 2007, pp. 329-334.
7. H. Herzel, O. Weiss, and E. Trifonov, "10-11 BP periodicities in complete genomes reflect protein structure and DNA folding", Bioinformatics, vol. 15, no. 3, pp. 187-193, 1999.
8. Y. Huang, X. Wu, X. Hu, F. Xie, J. Gao, and G. Wu, "Mining frequent patterns with gaps and one-off condition", in Proc. IEEE International Conference on Computational Science and Engineering (CSE'09), Vancouver, Canada, Aug. 2009, pp. 180-186.
9. X. Ji, J. Bailey, and G. Dong, "Mining minimal distinguishing subsequence patterns with gap constraints", in Proc. IEEE ICDM, Houston, Texas, USA, Nov. 2005, pp. 194-201.
10. C. Li, J. Wang, "Efficiently mining closed subsequences with gap constraints", in Proc. SIAM International Conference on Data Mining(SDM'08), Atlanta, Georgia, USA, Apr. 2008, 313-322.
11. J. Pei, J. Han, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.C. Hsu, "PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth", in Proc. IEEE ICDE'01, Heidelberg, Germany, Apr. 2001, pp. 215-224.
12. R. Srikant and R. Agrawal, Mining sequential patterns: generalizations and performance improvements, in Proc. EDBT'96, Avignon, France, 1996, pp.13-17.
13. M.J. Zaki. "SPADE: An efficient algorithm for mining frequent sequences", Machine Learning, vol. 42, pp. 31-60, 2001.
14. M. Zhang, B. Kao, D. Cheung, and K. Yip, "Mining periodic patterns with gap requirement from sequences", in Proc. ACM SIGMOD'05, Baltimore Maryland, 2005.
15. X. Zhu and X. Wu, "Mining complex patterns across sequences with gap requirements", in Proc. IJCAI'07, Hyderabad, India, Jan. 2007, pp. 726-735.
16. http://www.ncbi.nlm.nih.gov.