Sequential pattern mining in multi-databases via multiple alignment

Data Mining and Knowledge Discovery

Volumn 12, Issue 2-3, 2006, Pages 151-180

  Kum, Hye Chung ^a   Chang, Joong Hyuk ^b   Wang, Wei ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Yonsei University   (South Korea)

Author keywords

Approximate sequential pattern; Data mining algorithm; Global sequential pattern; Mining local pattern; Multiple alignment; Sequential patterns

Indexed keywords

APPROXIMATE SEQUENTIAL PATTERN; DATA MINING ALGORITHM; GLOBAL SEQUENTIAL PATTERN; MINING LOCAL PATTERN; MULTIPLE ALIGNMENT; SEQUENTIAL PATTERNS;

ALGORITHMS; COSTS; DATA ACQUISITION; DATABASE SYSTEMS; INFORMATION RETRIEVAL; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS;

DATA MINING;

EID: 33646573954     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-005-0017-3     Document Type: Article

References (28)

1. Agrawal, R. and Srikant, R. 1995. Mining sequential patterns. In Proc. of Inter national Conference on Data Engineering (ICDE), Taipei, Taiwan, pp. 3-14.
2. Ayres, J., Flannick, J., Gehrke, J., and Yiu, T. 2002. Sequential pattern mining using a bitmap representation. In Proceedings of the ACM International Conference on Knowledge discovery and data mining (SIGKDD), pp. 429-135.
3. Ertoz, L., Steinbach, M., and Kumar, V. 2003. Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In Third SIAM International Conference on Data Mining(SDM), San Fransico. CA, pp. 47-58.
4. Fukunaga, K.K. and Natendra, P.M. 1975. A branch and bound algorithm for computing k-nearest neighbours. IEEE Transactions on Computers, 24: 750-753.
5. Gotoh, O. 1999. Multiple sequence alignment: Algorithms and applications. Adv. Biophys., 36: 159-206.
6. Gusfield, D. 1997. Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge Univ. Press, Cambridge, England.
7. Jain, A.K., Murty, M.N., and Flynn, P.J. 1999. Data clustering: A review. ACM Computing Surveys, 31(3): 264-323.
8. Kohavi, R., Brodley, C., Frasca, B., Mason, L., and Zheng, Z. 2000. KDD-CUP 2000 Organizers' Report: Peeling the Onion. In Proc. SIGKDD Explorations, 2: 86-98.
9. Kum, H.C., Chang, J.H., and Wang, W. 2006. Benchmarking the Effectiveness of Sequential Pattern Mining Methods. Data and Knowledge Engineering, special issue on Intelligent Data Mining, forthercoming.
10. Kum, H.C., Paulsen, S., and Wang, W. 2005. Comparitive Study of Sequential Pattern Mining Models. Studies in Computational Intelligence: Foundations of Data Mining and Knowledge Discovery, Vol. 6, Springer, pp. 45-71.
11. Kum, H.C., Pei, J., Wang, W., and Duncan, D. 2003. ApproxMAP: Approximate mining of consensus sequential patterns. In Third SIAM International Conference on Data Mining(SDM), San Fransico, CA, pp. 311-315.
12. McPherson, G.R. and DeStefano, S. 2002. Applied Ecology and Natural Resource Management. Cambridge Univ. Press, Cambridge, England.
13. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., and Hsu, M.C. 2001. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. of International Conference on Data Engineering (ICDE), pp. 215-224.
14. Sander, J., Ester, M., Kriegel, H.P., and Xu, X. 1998. Density based clustering in spatial databases: The algorithm gdbscan and its applications. Data Mining and Knowledge Discovery, 2(2): 169-194.
15. Sas Institute. 2000. Proc Modeclust. In SAS/STAT User Guide: Sas online Document.
16. Spiliopoulou, M. 1999. Managing interesting rules in sequence mining. In Proc. European Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 554-560.
17. Srikant, R. and Agrawal, R. 1996. Mining sequential patterns: Generalizations and performance improvements. In Proc. 6th Intl. Conf Extending Database Technology (EDBT), pp. 3-17.
18. Thompson, J., Plewniak, F., and Poch, O. 1999. A comprehensive comparison of multiple sequence alignment programs. Oxford Univ. Press. Nucleic Acids Research, 27(13): 2682-2690.
19. Wong, M.A. and Lane, T. 1983. A kth nearest neighbor clustering procedure. Journal of the Royal Statistical Society, Series B, 45: 362-368.
20. Wu, X. and Zhang, S. 2003. Synthesizing high-frequency rules from different data sources. IEEE Trans. Knowledge Data Engineering, 15(2): 353-367.
21. Wu, X., Zhang, C., and Zhang, S. 2005, Database classification for multi-database mining. Information System, 30(1): 71-88.
22. Yan, X., Han, J., and Afshar, R. 2003. CloSpan: Mining closed sequential patterns in larege datasets. In Third SIAM International Conference on Data Mining (SDM), San Fransico, CA, pp. 166-177.
23. Yang, J., Yu, P.S., Wang, W., and Han, J. 2002. Mining long sequential patterns in a noisy environment. In Proc. of ACM Int'l Conf. On Management of Data (SIGMOD), Madison, WI, pp. 406-117.
24. Zaki, M.J. 1998. Efficient enumeration of frequent sequences. In 7th International Conference Information and Knowledge Management, pp. 68-75.
25. Zhang, C., Liu, M., Nie, W., and Zhang, S. 2004a. Identifying global exceptional patterns in multi-database mining. IEEE Computational Intelligence Bulletin, 3(1): 19-24.
26. Zhang, S., Wu, X., and Zhang, C. 2003. Multi-Database Mining. IEEE Computational Intelligence Bulletin, 2(1): 5-13.
27. Zhang, S., Zhang, C., and Yu, J.X. 2004b. An efficient strategy for mining exceptions in multi-databases. Information System, 165(1-2): 1-20.
28. Zhong, N., Yao, Y., and Ohsuga, S. 1999. Peculiarity oriented multi-database mining. In Proceedings of PKDD, pp. 136-146.