Extract frequent pattern from simple graph data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2419, Issue , 2002, Pages 158-169

  Yuan, Qingqing ^a   Lou, Yubo ^a   Zhou, Haofeng ^a   Wang, Wei ^a   Shi, Baile ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; INFORMATION MANAGEMENT;

DATA SET; GRAPH DATA; REAL-WORLD; SFP-TREE; SIMPLE TYPES; SYNTHETIC DATASETS;

TREES (MATHEMATICS);

EID: 84944074417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45703-8_15     Document Type: Conference Paper

References (12)

1. Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad. Depth first generation of long patterns. KDD 2000: 108-118
2. Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. In J. of Parallel and Distribute Computing, 2000.
3. Rakesh Agrawal, Ramakrishnan Srikant. Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487-499
4. Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur. Dynamic Itemset Counting and Implication Rules for Market Basket Data. SIGMOD Conference 1997: 255-264
5. Jiawei Han, Jian Pei, Yiwen Yin. Mining Frequent Patterns without Candidate Generation. SIGMOD Conference 2000: 1-12
6. Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. PDKK 2000: 13-23
7. Michihiro Kuramochi, George Karypis. Frequent Subgraph Discovery. ICDM 2001: 313-320
8. Heikki Mannila, Hannu Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery 1(3): 241-258 (1997)
9. Jong Soo Park, Ming-Syan Chen, Philip S. Yu. An Effective Hash Based Algorithm for Mining Association Rules. SIGMOD Conference 1995: 175-186
10. Mike Perkowitz, Oren Etzioni. Adaptive Sites: Automatically learning from user access patterns. In Proc. 6th Int. World Wide Web Conf.(WWW’97), Santa Clara, California, April 1997.
11. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. H-Mine: Hyper-Structure Proc. 2001 Int. Conf. on Data Mining (ICDM’01), San Jose, CA, Nov. 2001
12. J. Pei, J. Han, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. Proc. 2001 Int. Conf. on Data Engineering (ICDE’01), Heidelberg, Germany, April 2001.