Constraint-based sequential pattern mining: The pattern-growth methods

Journal of Intelligent Information Systems

Volumn 28, Issue 2, 2007, Pages 133-160

  Pei, Jian ^a   Han, Jiawei ^b   Wang, Wei ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

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

^c FUDAN UNIVERSITY   (China)

Author keywords

Frequent pattern mining; Mining with constraints; Pattern growth methods; Sequential pattern mining

Indexed keywords

CONSTRAINT THEORY; INFORMATION SYSTEMS; INTELLIGENT SYSTEMS;

FREQUENT PATTERN MINING; PATTERN GROWTH METHODS; SEQUENTIAL PATTERN MINING;

PATTERN MATCHING;

EID: 33947584673     PISSN: 09259902     EISSN: 15737675     Source Type: Journal    
DOI: 10.1007/s10844-006-0006-z     Document Type: Article

References (25)

1. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'93) (pp. 207-216). New York: ACM.
2. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94) (pp. 487-499). California: Morgan Kaufmann.
3. Agrawal, R., & Srikant, R. (.1995). Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering (ICDE'95) (pp. 3-14). Washington, District of Columbia: IEEE Computer Society.
4. Ayres, J., Flannick, J., Gehrke, J., & Yiu, T. (2002). Sequential pattern mining using a bitmap representation. In Proc. 2002 ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD'02) (pp. 429-435). New York: ACM.
5. Bayardo, R.J., Agrawal, R., & Gunopulos, D. (1999). Constraint-based rule mining on large, dense data sets. In Proc. 1999 Int. Conf. Data Engineering (ICDE'99) (pp. 188-197). Washington, District of Columbia: IEEE Computer Society.
6. Chiu, D.-Y., Wu, Y.-H., & Chen, A.L.P. (2004). An efficient algorithm for mining frequent sequences by a new strategy without support counting. In Proc. of the Twentieth IEEE International Conference on Data Engineering (ICDE'04) (pp. 275-286). Boston, Massachusetts: IEEE Computer Society.
7. Garofalakis, M., Rastogi, R., & Shim, K. (1999). SPIRIT: Sequential pattern mining with regular expression constraints. In Proc. 1999 Int. Conf. Very Large Data Bases (VLDB'99) (pp. 223-234). San Francisco, California: Morgan Kaufmann.
8. Grahne, G., Lakshmanan, L., & Wang, X. (2000). Efficient mining of constrained correlated sets. In Proc. 2000 Int. Conf. Data Engineering (ICDE'00) (pp. 512-521). Washington, District of Columbia: IEEE Computer Society.
9. Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q., Dayal, U., & Hsu, M.C. (2000). FreeSpan: Frequent pattern-projected sequential pattern mining. In Proc. 2000 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'00) (pp. 355-359). New York: ACM.
10. Kifer, D., Gehrke, J., Bucila, C., & White, W. (2003). How to quickly find a witness. In Proc. 2003 ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'03) (pp. 272-283). New York: ACM.
11. Kum, H.C.M., Pei, J., & Wang, W. (2003). Approxmap : Approximate mining of consensus sequential patterns. In Proc. 2003 SIAM Int. Conf. Data Mining (pp. 311-315). San Francisco, California.
12. Mannila, H., Toivonen, H. & Verkamo, A.I. (1997). Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov., 1:259-289.
13. Ng, R., Lakshmanan, L.V.S., Han, J., & Pang, A. (1998). Exploratory mining and pruning optimizations of constrained associations rules. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98) (pp. 13-24). New York: ACM.
14. Pei, J. & Han, J. (2000). Can we push more constraints into frequent pattern mining? In Proc. 2000 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'00) (pp. 350-354). New York: ACM.
15. Pei, J., Han, J., & Lakshmanan, L.V.S. (2001). Mining frequent itemsets with convertible constraints. In Proc. 2001 Int. Conf. Data Engineering (ICDE'01) (pp. 433-442). Washington, District of Columbia: IEEE Computer Society.
16. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., et al. (2001). PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. 2001 Int. Conf. Data Engineering (ICDE'01) (pp. 215-224). Washington, District of Columbia: IEEE Computer Society.
17. Pei, J., Han, J., & Wang, W. (2002). Constraint-based sequential pattern mining in large databases. In Proc. 2002 Int. Conf. on Information and Knowledge Management (CIKM'02) (pp. 18-25). New York: ACM.
18. Pinto, H., Han, J., Pei, J., Wang, K., Chen, Q., & Dayal, U. (2001). Multi-dimensional sequential pattern mining. In Proc. 2001 Int. Conf. Information and Knowledge Management (CIKM'01) (pp. 81-88). New York: ACM.
19. Srikant, R. & Agrawal, R. (1996). Mining sequential patterns: Generalizations and performance improvements. In Proc. 5th Int. Conf. Extending Database Technology (EDBT'96) (pp. 3-1.7). Berlin Heidelberg New York: Springer.
20. Tzvetkov, P., Yan, X., & Han, J. (2003). Tsp: Mining top-k closed sequential patterns. In Proc. of the Third IEEE International Conference on Data Mining (ICDM'03) (p. 347). Washington, District of Columbia: IEEE Computer Society.
21. Wang, K. & Tan, J. (1996). Incremental discovery of sequential patterns. In Proc. 1996 SIGMOD'96 Workshop Research Issues on Data Mining and Knowledge Discovery (DMKD'96) (pp. 95-102). New York: ACM.
22. Yan, X., Han, J., & Afshar, R. (2003). CloSpan: Mining closed sequential patterns in large databases. In Proc. 2003 SIAM Int. Conf. Data Mining (pp. 406-417). New York: ACM.
23. Yang, J., Yu, P.S., Wang, W. & Han, J. (2002). Mining long sequential patterns in a noisy environment. In Proc. 2002 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD'02) (pp. 68-75). New York: ACM.
24. Zaki, M.J. (1998). Efficient enumeration of frequent sequences. In Proc. 7th Int. Conf. Information and Knowledge Management (CIKM'98) (pp. 68-75). Washington, District of Columbia.
25. Zaki, M.J. (2001). Spade: An efficient algorithm for mining frequent sequences. Mach. Learn., 42 (1-2), 31-60.