Efficient pattern-growth methods for frequent tree pattern mining

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

Volumn 3056, Issue , 2004, Pages 441-451

  Wang, Chen ^a   Hong, Mingsheng ^a   Pei, Jian ^b   Zhou, Haofeng ^a   Wang, Wei ^a   Shi, Baile ^a  

^a FUDAN UNIVERSITY   (China)

^b UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHOPPERS (CIRCUITS); DIGITAL LIBRARIES; FORESTRY; ALGORITHMS; DATA MINING; DATABASE SYSTEMS; ELECTRONIC COMMERCE; RESEARCH AND DEVELOPMENT MANAGEMENT; TREES (MATHEMATICS);

BROAD APPLICATION; FREQUENT PATTERN MINING; FREQUENT TREE PATTERN; LARGE DATABASE; PATTERN GROWTH; PERFORMANCE STUDY; RESEARCH PROBLEMS;

DATA MINING; PATTERN MATCHING;

BIOINFORMATICS; PATTERN MINING; PATTERN-GROWTH METHODS;

EID: 7444249756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24775-3_54     Document Type: Conference Paper

References (13)

1. R. C. Agarwal, et al. A tree projection algorithm for generation of frequent item sets. J. of Parallel and Distributed Computing, 61(3):350–371, 2001.
2. T. Asai, et al. Efficient substructure discovery from large semi-structured data. In Proc. 2002 SIAM Int. Conf. Data Mining, Arlington, VA.
3. D. Cook and L. Holder. Substructure discovery using minimal description length and background knowledge. J. of Artificial Intelligence Research, 1:231–255, 1994.
4. L. Dehaspe, et al. Finding frequent substructures in chemical compounds. In KDD’98, New York, NY.
5. J. Han, et al. Mining frequent patterns without candidate generation. In SIGMOD’ 00, Dallas, TX.
6. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM’01, San Jose, CA.
7. T. Miyahara, et al. Discovery of frequent tree structured patterns in semistructured web documents. In PAKDD’01, Hong Kong, China.
8. J. Pei, et al. H-Mine: Hyper-structure mining of frequent patterns in large databases. In ICDM’01, San Jose, CA.
9. J. Pei, et al. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE’01, Heidelberg, Germany.
10. R. Srikant and R. Agrawal. Mining generalized association rules. In VLDB’95, Zurich, Switzerland.
11. J.T.L. Wang, et al. Automated discovery of active motifs in multiple RNA secondary structures. In KDD’96, Portland, Oregon.
12. K. Wang and H. Liu. Schema discovery for semistructured data. In KDD’97, Newport Beach, CA.
13. M.J. Zaki. Efficiently mining frequent trees in a forest. In KDD’02, Edmonton, Alberta, Canada.