From sequential pattern mining to structured pattern mining: A pattern-growth approach

Journal of Computer Science and Technology

Volumn 19, Issue 3, 2004, Pages 257-279

  Han, Jia Wei ^a   Pei, Jian ^b   Yan, Xi Feng ^a  

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

^b UNIVERSITY AT BUFFALO   (United States)

Author keywords

Data mining; Performance analysis; Scalability; Sequential pattern mining; Structured pattern mining

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DNA; GRAPH THEORY; MUTAGENESIS; PATTERN MATCHING; PERFORMANCE; WEBSITES;

PERFORMANCE ANALYSIS; SCALABILITY; SEQUENTIAL PATTERN MINING; STRUCTURED PATTERN MINING;

DATA MINING;

EID: 2442650185     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02944897     Document Type: Article

References (37)

1. Agrawal R, Srikant R. Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering (ICDE'95), Taipei, Taiwan, Mar. 1995, pp.3-14.
2. Srikant R, Agrawal R. Mining sequential patterns: Generalizations and performance improvements. In Proc. 5th Int. Conf. Extending Database Technology (EDBT'96), Avignon, France, Mar, 1996, pp.3-17.
3. Mannila H, Toivonen H, Verkamo A I. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1997, 1: 259-289.
4. Wang J, Chirn G, Marr T, Shapiro B, Shasha D, Zhang K. Combinatorial pattern discovery for scientific data: Some preliminary results. In Proc. 1994 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'94), Minneapolis, MN, May, 1994, pp. 115-125.
5. Bettini C, Wang X S, Jajodia S. Mining temporal relationships with multiple granularities in time sequences. Data Engineering Bulletin, 1998, 21: 32-38.
6. Zaki M J. Efficient enumeration of frequent sequences. In Proc. 7th Int. Conf. Information and Knowledge Management (CIKM'98), Washington D.C., Nov. 1998, pp.68-75.
7. Masseglia F, Cathala F, Poncelet P. The psp approach for mining sequential patterns. In Proc. 1998 European Symp. Principle of Data Mining and Knowledge Discovery (PKDD'98), Nantes, France, Sept. 1998, pp.176-184.
8. Lu H, Han J, Feng L. Stock movement and n-dimensional inter-transaction association rules. In Proc. 1998 SIGMOD Workshop Research Issues on Data Mining and Knowledge Discovery (DMKD'98), Seattle, WA, June 1998, pp.12:1-12:7.
9. Özden B, Ramaswamy S, Silberschatz A. Cyclic association rules. In Proc. 1998 Int. Conf. Data Engineering (IODE'98), Orlando, FL, Feb. 1998, pp.412-421.
10. Han J, Dong G, Yin Y. Efficient mining of partial periodic patterns in time series database. In Proc. 1999 Int. Conf. Data Engineering (ICDE'99), Sydney, Australia, April 1999, pp.106-115.
11. Ramaswamy S, Mahajan S, Silberschatz A. On the discovery of interesting patterns in association rules. In Proc. 1998 Int. Conf. Very Large Data Bases (VLDB'98), New York, NY, Aug. 1998, pp.368-379.
12. Guha S, Rastogi R, Shim K. Rock: A robust clustering algorithm for categorical attributes. In Proc. 1999 Int. Conf. Data Engineering (ICDE'99), Sydney, Australia, Mar. 1999, pp.512-521.
13. Zaki M. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 2001, 40: 31-60.
14. Zaki M J, Hsiao C J. CHARM: An efficient algorithm for closed itemset mining. In Proc. 2002 SIAM Int. Conf. Data Mining (SDM'02), Arlington, VA, April 2002, pp.457-473.
15. Agrawal R, Srikant R. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94), Santiago, Chile, Sept. 1994, pp.487-499.
16. Han J, Pei J, Mortazavi-Asl B, Chen Q, Dayal U, Hsu M C. FreeSpan: Frequent pattern-projected sequential pattern mining. In Proc. 2000 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'00), Boston, MA, Aug. 2000, pp.355-359.
17. Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. 2000 European Symp. Principle of Data Mining and Knowledge Discovery (PKDD'00), Lyon, France, Sept. 1998, pp.13-23.
18. Kuramochi M, Karypis G. Frequent subgraph discovery. In Proc. 2001 Int. Conf. Data Mining (ICDM'01), San Jose, CA, Nov. 2001, pp.313-320.
19. Vanetik N, Gudes E, Shimony S E. Computing frequent graph patterns from semistructured data. In Proc. 2002 Int. Conf. Data Mining (ICDM'02), Maebashi, Japan, Dec. 2002, pp.458-465.
20. Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00), Dallas, TX, May 2000, pp.1-12.
21. Cormen T, Leiserson C, Rivest R, Stein C. Introduction to Algorithms, 2nd ed. The MIT Press, Cambridge, MA, 2001.
22. Yan X, Han J. gSpan: Graph-based substructure pattern mining. In UIUC-CS Tech. Report: R-2002-2296, A 4-page short version published in Proc. 2002 Int. Conf. Data Mining (ICDM'02), Maebashi, Japan, 2002, pp.721-724.
23. Kohavi R, Brodley C, Frasca B, Mason L, Zheng Z. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2000, 2: 86-98.
24. Han J, Fu Y. Discovery of multiple-level association rules from large databases. In Proc. 1995 Int. Conf. Very Large Data Bases (VLDB'95), Zurich, Switzerland, Sept. 1995, pp.420-431.
25. Kamber M, Han J, Chiang J Y. Metarule-guided mining of multi-dimensional association rules using data cubes. In Proc. 1997 Int. Conf. Knowledge Discovery and Data Mining (KDD'97), Newport Beach, CA, Aug. 1997, pp.207-210.
26. Grahne G, Lakshmanan L V S, Wang X, Xie M H. On dual mining: From patterns to circumstances, and back. In Proc. 8001 Int. Conf. Data Engineering (ICDE'01), Heidelberg, Germany, April 2001, pp. 195-204.
27. Pinto H, Han J, Pel J, Wang K, Chen Q, Dayal U. Multi-dimensional sequential pattern mining. In Proc. 2001 Int. Conf. Information and Knowledge Management (CIKM'01), Atlanta, GA, Nov. 2001, pp.81-88.
28. Beyer K, Ramakrishnan R. Bottom-up computation of sparse and iceberg cubes. In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'99), Philadelphia, PA, June 1999, pp.359-370,
29. Han J, Pei J, Dong G, Wang K. Efficient computation of iceberg cubes with complex measures. In Proc. 2001 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'01), Santa Barbara, CA, May 2001, pp.1-12.
30. Ng R, Lakshmanan L V S, Han J, Pang A. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), Seattle, WA, June 1998, pp. 13-24.
31. Bayardo R J, Agrawal R, Gunopulos D. Constraint-based rule mining on large, dense data sets. In Proc. 1999 Int. Conf. Data Engineering (ICDE'99), Sydney, Australia, April 1999, 188-197.
32. Pei J, Han J, Lakshmanan L V S. Mining frequent item-sets with convertible constraints. In Proc. 2001 Int. Conf, Data Engineering (ICDE'01), Heidelberg, Germany, April 2001, pp.433-442.
33. Pei J, Han J, Wang W. Constraint-based sequential pattern mining in large databases. In Proc. 2002 Int. Conf. Information and Knowledge Management (CIKM'02), McLean, VA, Nov. 2002, pp.18-25.
34. Asai T, Abe K, Kawasoe S, Arimura H, Satamoto H, Arikawa S. Efficient substructure discovery from large semi-structured data. In Proc. 2002 SIAM Int. Conf. Data Mining (SDM'OS), Part III, Arlington, VA, April 2002.
35. Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M C. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. 2001 Int. Conf. Data Engineering (ICDE'01), Heidelberg, Germany, April 2001, pp.215-224.
36. Yan X, Han J. gSpan: Graph-based substructure pattern mining. In Proc. 2002 Int. Conf. Data Mining (ICDM'02), Maebashi, Japan, Dec. 2002, pp.721-724.
37. Yan X, Han J. CloseGraph: Mining closed frequent graph patterns. In Proc. 2003 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD'03), Washington D.C., Aug. 2003.