Efficient mining of gap-constrained subsequences and its various applications

ACM Transactions on Knowledge Discovery from Data

Volumn 6, Issue 1, 2012, Pages

  Li, Chun ^a   Yang, Qingyan ^a   Wang, Jianyong ^a   Li, Ming ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Algorithms

Indexed keywords

APPLICATION DOMAINS; CLASSIFICATION AND CLUSTERING; CLASSIFICATION/CLUSTERING; CLOSED SEQUENTIAL PATTERNS; DATA MINING PROBLEMS; HIGH QUALITY; INPUT SEQUENCE; PERFORMANCE STUDY; SEQUENTIAL PATTERN MINING ALGORITHM; SEQUENTIAL PATTERNS; SINGLE INPUT;

DATA MINING; INTELLIGENT NETWORKS;

ALGORITHMS;

EID: 84859393676     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/2133360.2133362     Document Type: Article

References (45)

1. AGGARWAL, C. C., TA, N., WANG, J., FENG, J., AND ZAKI, M. 2007. XPROJ: A framework for projected structural clustering of XML documents. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 46-55. (Pubitemid 350229192)
2. AGRAWAL, R. AND SRIKANT, R. 1995. Mining sequential patterns. In Proceedings of the 11th International Conference on Data Engineering (ICDE). IEEE, 3-14.
3. AYRES, J., FLANNICK, J., GEHRKE, J., AND YIU, T. 2002. Sequential pattern mining using a bitmap representation. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 429-435.
4. CASAS-GARRIGA, G. 2005. Summarizing sequential data with closed partial orders. In Proceedings of the 2005 SIAM International Conference on Data Mining (SDM).
5. CHANDONIA, J.M.,HON, G.,WALKER, N. S., LO CONTE, L., KOEHL, P., LEVITT, M., AND BRENNER, S. E. 2004. The ASTRAL compendium in 2004. Nucl. Acids Res. 32, (Database issue).
6. CHANG, C.-C. AND LIN, C.-J. 2001. LIBSVM: A library for support vector machines. http://www.csie.ntu.edu.tw/ cjlin/libsvm.
7. CHEN, J. AND COOK, T. 2007. Mining contiguous sequential patterns from web logs. In Proceedings of the 16th International Conference on World Wide Web (WWW). ACM, New York, 1177-1178. (Pubitemid 47582370)
8. CHENG, H., YAN, X.,HAN, J., AND YU, P. S. 2008. Direct discriminative pattern mining for effective classification. In Proceedings of the 24th International Conference on Data Engineering (ICDE). 169-178.
9. DESHPANDE, M. AND KARYPIS, G. 2002. Evaluation of techniques for classifying biological sequences. In Proceedings of the 6th Pacific-Asia Cinference on Knowledge Discovery and Data Mining (PAKDD). 417-431.
10. DESHPANDE, M., KURAMOCHI, M., WALE, N., AND KARYPIS, G. 2005. Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17, 8, 1036-1050. (Pubitemid 41259847)
11. DIETTERICH, T. G. 1998. Approximate statistical test for comparing supervised classification learning algorithms. Neural Computation 10, 7, 1895-1923. (Pubitemid 128463689)
12. EDWARDS, S. 2008. Thomas M. Cover and Joy A. Thomas, Elements of Information Theory 2nd Ed., John Wiley & Sons, Inc. Inf. Process. Manage. 44, 1, 400-401.
13. GAO, C.,WANG, J., HE, Y., AND ZHOU, L. 2008. Efficient mining of frequent sequence generators. In Proceedings of the 17th International Conference on World Wide Web (WWW). 1051-1052.
14. GAROFALAKIS, M. N., RASTOGI, R., AND SHIM, K. 1999. Spirit: Sequential pattern mining with regular expression constraints. In Proceedings of 25th International Conference on Very Large Data Bases (VLDB). M. P. Atkinson, M. E. Orlowska, P. Valduriez, S. B. Zdonik, and M. L. Brodie Eds., Morgan Kaufmann, 223-234.
15. HAN, J., DONG, G., AND YIN, Y. 1999. Efficient mining of partial periodic patterns in time series database. In Proceedings of the 15th International Conference on Data Engineering, IEEE Computer Society, 106-115.
16. HAN, J., PEI, J., MORTAZAVI-ASL, B., CHEN, Q., DAYAL, U., AND HSU, M. 2000. Freespan: Frequent pattern-projected sequential pattern mining. In Proceedings of the 6th ACM International Conference on Knowledge Discovery and Data Mining (KDD). 355-359.
17. HARTIGAN, J. A. AND WONG, M. A. 1979. A K-means clustering algorithm. Appl. Stat. 28, 100-108.
18. JI, X., BAILEY, J., AND DONG, G. 2005. Mining minimal distinguishing subsequence patterns with gap constraints. In Proceedings of the 5th IEEE International Conference on Data Mining (ICDM). IEEE Computer Society Press, 194-201. (Pubitemid 47385693)
19. LESLIE, C., ESKIN, E., AND NOBLE, W. S. 2002. The spectrum kernel: A string kernel for svm protein classification. Pac Symp Biocomput, 564-575.
20. LI, Z.,CHEN, Z., SRINIVASAN, S.M., AND ZHOU, Y. 2004. C-miner: Mining block correlations in storage systems. In Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST). USENIX Association, Berkeley, CA, 173-186.
21. LI, Z., LU, S.,MYAGMAR, S., AND ZHOU, Y. 2006. Cp-miner: Finding copy-paste and related bugs in largescale software code. IEEE Trans. Softw. Engin. 32, 3, 176-192.
22. LO, D. AND KHOO, S.-C. 2006. Smartic: Towards building an accurate, robust and scalable specification miner. In Proceedings of the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering. ACM, New York, 265-275. (Pubitemid 47129403)
23. LODHI, H., TAYLOR, J. S., CRISTIANINI, N., AND WATKINS, C. J. C. H. 2000. Text classification using string kernels. In Proceedings of the 14th Conference on Neural Information Processing Systems (NIPS). 563-569.
24. MANNILA, H., TOIVONEN, H., AND VERKAMO, I. A. 1997. Discovery of frequent episodes in event sequences. Data Min. Knowl. Disc. 1, 3, 259-289. (Pubitemid 127721244)
25. MASSEGLIA, F., CATHALA, F., AND PONCELET, P. 1998. The PSP approach for mining sequential patterns. In Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD). Springer-Verlag, 176-184. (Pubitemid 128145834)
26. PEI, J., HAN, J., AND WANG, W. 2007. Constraint-based sequential pattern mining: the pattern-growth methods. J. Intell. Inf. Syst. 28, 2, 133-160. (Pubitemid 46479918)
27. PEI, J., HAN, J., ASL, M. B., PINTO, H., CHEN, Q., DAYAL, U., AND HSU, M. C. 2001. Prefixspan mining sequential patterns efficiently by prefix projected pattern growth. In Proceedings 17th International Conference on Data Engineering. 215-226.
28. PEI, J., LIU, J., WANG, H., WANG, K., YU, P. S., AND WANG, J. 2005. Efficiently mining frequent closed partial orders. In Proceedings of the IEEE International Conference on Data Mining. 753-756. (Pubitemid 47385788)
29. RIGOUTSOS, I. AND FLORATOS, A. 1998. Combinatorial pattern discovery in biological sequences: The Teiresias algorithm. Bioinformatics 14, 1, 55-67. (Pubitemid 28397726)
30. RISH, I. 2001. An empirical study of the naive bayes classifier. IJCAI-01 Workshop on Empirical Methods in AI.
31. SAIGO, H., KRÄMER, N., AND TSUDA, K. 2008. Partial least squares regression for graph mining. In Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 578-586.
32. SENO, M. AND KARYPIS, G. 2002. Slpminer: An algorithm for finding frequent sequential patterns using length-decreasing support constraint. In Proceedings of the IEEE International Conference on Data Mining (ICDM). IEEE Computer Society Press, 418.
33. SHE, R., CHEN, F., WANG, K., ESTER, M., GARDY, J. L., AND BRINKMAN, F. S. L. 2003. Frequentsubsequence- based prediction of outer membrane proteins. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 436-445.
34. SRIKANT, R. AND AGRAWAL, R. 1996. Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the 5th International Conference on Extending Database Technology (EDBT). P. M. G. Apers, M. Bouzeghoub, and G. Gardarin Eds., Springer-Verlag, Vol. 1057. 3-17.
35. WANG, J. AND KARYPIS, G. 2005. Harmony: Efficiently mining the best rules for classification. In Proceedings of the 2005 SIAM International Conference on Data Mining (SDM).
36. WANG, J., HAN, J., AND LI, C. 2007. Frequent closed sequence mining without candidate maintenance. IEEE Trans. Knowl. Data Eng. 19, 8, 1042-1056. (Pubitemid 47000342)
37. WANG, J., ZHANG, Y., ZHOU, L., KARYPIS, G., AND AGGARWAL, C. C. 2009. Contour: An efficient algorithm for discovering discriminating subsequences. Data Min. Knowl. Discov. 18, 1, 1-29.
38. XIE, T. AND PEI, J. 2006. Data mining for software engineering. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). Tutorial.
39. YAN, X., HAN, J., AND AFSHAR, R. 2003. CLOSPAN: Mining closed sequential patterns in large datasets. In Proceedings of the 2003 SIAM International Conference on Data Mining (SDM). 166-177.
40. YANG, J.,WANG, W., YU, P. S., AND HAN, J. 2002. Mining long sequential patterns in a noisy environment. In Proceedings of the 2002 ACMSIGMOD International Conference on Management of Data (SIGMOD). ACM, New York, 406-417. (Pubitemid 34985565)
41. ZAKI, M. J. 2001. SPADE: An efficient algorithm for mining frequent sequences. Mach. Learn. 42, 31-60. (Pubitemid 32872398)
42. ZHANG, M., KAO, B., CHEUNG, D.W., AND YIP, K. Y. 2007. Mining periodic patterns with gap requirement from sequences. ACM Trans. Knowl. Discov. Data 1, 2, 7.
43. ZHU, X. AND WU, X. 2007. Mining complex patterns across sequences with gap requirements. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI). 2934-2941.
44. ZHU, F., YAN, X., HAN, J., AND YU, P. S. 2007a. Efficient discovery of frequent approximate sequential patterns. In Proceedings of the IEEE International Conference on Data Mining. 751-756.
45. ZHU, F., YAN, X., HAN, J., YU, P. S., AND CHENG, H. 2007b. Mining colossal frequent patterns by core pattern fusion. In Proceedings of the International Conference on Data Engineering. 706-715. (Pubitemid 47422074)