HybridTreeMiner: An efficient algorithm for mining frequent rooted trees and free trees using canonical forms

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn 16, Issue , 2004, Pages 11-20

  Chi, Yun ^a   Yang, Yirong ^a   Muntz, Richard R ^a  

^a University of California   (United States)

Author keywords

Canonical form; Enumeration tree; Free tree; Frequent subtree; Rooted unordered tree; Tree isomorphism

Indexed keywords

CANONICAL FORMS; ENUMERATION TREE; FREE TREE; FREQUENT SUBTREE; ROOTED UNORDERED TREE; TREE ISOMORPHISM;

ALGORITHMS; COMPUTATION THEORY; DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS; PATTERN RECOGNITION; TREES (MATHEMATICS); WORLD WIDE WEB; XML;

DATA MINING;

EID: 5444259929     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Intl. Conf. on Very Large Databases (VLDB'94), 1994.
2. J. M. Aldous and R. J. Wilson. Graphs and Applications, An Introductory Approach. Springer, 2000.
3. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Satamoto, and S. Arikawa. Efficient substructure discovery from large semi-structured data. In 2nd SIAM bit. Conf. on Data Mining (SDM'02), 2002.
4. T. Asai, H. Arimura, T. Uno, and S. Nakano. Discovering frequent substructures in large unordered trees. Technical Report DOI-TR-CS 216, Department of Informatics, Kyushu University, June 2003.
5. Y. Chi, Y. Yang, and R. R. Muntz. Indexing and mining free trees. In Proc. of the 2003 IEEE Intl. Conf. on Data Mining (ICDM'03), 2002.
6. Y. Chi, Y. Yang, and R. R. Muntz. Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, ftp://ftp.cs.ucla.edu/tech-report/2003-reports/030043.pdf, UCLA, 2003.
7. J. Cui, J. Kim, D. Maggiorini, K. Boussetta, and M. Gerla. Aggregated muldcast-a comparative study. In Proceedings of IFIP Networking 2002, 2002.
8. J. Hein, T. Jiang, L. Wang, and K. Zhang. On use complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71:153-169, 1996.
9. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In Proc. 2003 Int. Conf. an Data Mining (ICDM'03), 2003.
10. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of the 4th European Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'00), pages 13-23, 2000.
11. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. of the 2001 IEEE Intl. Conf on Data Mining (ICDM'01), 2001.
12. A. Medina, A. Lakhina, I. Matta, and J. Byers. Brite: Universal topology generation from a user's perspective. Technical Report BUCS-TR2001-003, Boston University, 2001.
13. N. C. I. (NCI). DTP/2D and 3D structural information. World Wide Web, ftp://dtpsearch.ncifcrf.gov/jan03_2d.bin, 2003.
14. S. Nijssen and J. N. Kok. Efficient discovery of frequent unordered trees. In first Intl. Workshop on Mining Graphs, Trees and Sequences (MGST'03), 2003.
15. J. Punin and M. Krishnamoorthy. WWWPal system-a system for analysis and synthesis of web pages. In WebNet 98 Conference, 1998.
16. D. Shasha, J. T. L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In. Symposium on Principles of Database Systems, pages 39-52, 2002.
17. D. Shasha, J. T. L. Wang, H. Shan, and K. Zhang. ATree-Grep: Approximate searching in unordered trees. In Proc. of the 14th Intl. Conf. on Scientific and Statistical Database Management (SSDBM'02), 2002.
18. A. Termier, M.-C. Rousset, and M. Sebag. TreeFinder: a first step towards xml data mining. In Proc. of the 2002 IEEE Intl. Conf. on Data Mining (ICDM'02), 2002.
19. J. T. L. Wang, H. Shan, D. Shasha, and W. H. Piel. Treerank: A similarity measure for nearest neighbor searching in phylogenetic databases. In Proc. of the 15th Intl. Conf. on Scientific and Statistical Database Management (SSDBM'03), 2003.
20. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proc. 2002 Intl. Conf. on Data Mining (ICDM'02), 2002.
21. M. J. Zaki. Efficiently mining frequent trees in a forest. In Proc. 2002 Intl. Conf. Knowledge Discovery and Data Mining (SIGKDD'02), July 2002.
22. M. J. Zaki and C. C. Aggarwal. XRules: An effective structural classifier for XML data. In Proc. of the 2003 Int. Conf. Knowledge Discovery and Data Mining (SIGKDD'03), 2003.