Efficient pattern-growth methods for frequent tree pattern mining
Publication
, Conference
Wang, C; Hong, M; Pei, J; Zhou, H; Wang, W; Shi, B
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
January 1, 2004
Mining frequent tree patterns is an important research problems with broad applications in bioinformatics, digital library, ecommerce, and so on. Previous studies highly suggested that patterngrowth methods are efficient in frequent pattern mining. In this paper, we systematically develop the pattern growth methods for mining frequent tree patterns. Two algorithms, Chopper and XSpanner, are devised. An extensive performance study shows that the two newly developed algorithms outperform TreeMinerV [13], one of the fastest methods proposed before, in mining large databases. Furthermore, algorithm XSpanner is substantially faster than Chopper in many cases.
Duke Scholars
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
ISBN
9783540220640
Publication Date
January 1, 2004
Volume
3056
Start / End Page
441 / 451
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
Wang, C., Hong, M., Pei, J., Zhou, H., Wang, W., & Shi, B. (2004). Efficient pattern-growth methods for frequent tree pattern mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3056, pp. 441–451). https://doi.org/10.1007/978-3-540-24775-3_54
Wang, C., M. Hong, J. Pei, H. Zhou, W. Wang, and B. Shi. “Efficient pattern-growth methods for frequent tree pattern mining.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3056:441–51, 2004. https://doi.org/10.1007/978-3-540-24775-3_54.
Wang C, Hong M, Pei J, Zhou H, Wang W, Shi B. Efficient pattern-growth methods for frequent tree pattern mining. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2004. p. 441–51.
Wang, C., et al. “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), vol. 3056, 2004, pp. 441–51. Scopus, doi:10.1007/978-3-540-24775-3_54.
Wang C, Hong M, Pei J, Zhou H, Wang W, Shi B. 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). 2004. p. 441–451.
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
ISBN
9783540220640
Publication Date
January 1, 2004
Volume
3056
Start / End Page
441 / 451
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences