UNI3 - Efficient algorithm for mining unordered induced subtrees using TMG candidate generation

Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007

Volumn , Issue , 2007, Pages 568-575

  Hadzic, Fedja ^a   Tan, Henry ^a   Dillon, Tharam S ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Canonical form; Frequent subtree mining; Induced unordered subtrees; Tree isomorphism

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; TREES (MATHEMATICS); WORLD WIDE WEB; XML;

CANONICAL FORMS; FREQUENT SUBTREE MINING; INDUCED UNORDERED SUBTREES; TREE ISOMORPHISM;

DATA MINING;

EID: 34548757503     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIDM.2007.368926     Document Type: Conference Paper

References (16)

1. th International Conference on Discovery Science, 2003.
2. S. Nijssen, and J.N. Kok, "Efficient discovery of frequent unordered trees", In Proc. of the 1st International Workshop Mining Graphs, Trees, and Sequences (MGTS-2003), Dubrovnik, Croatia, 2003.
3. Y. Chi, Y. Yirong, and R. R. Muntz, "Canonical Forms for Labeled Trees and Their Applications in Frequent Subtree Mining", Knowledge and Information Systems, 2004.
4. Y. Chi, Y. Yang, and R.R. Muntz, "HybridTreeMiner: An efficient algorihtm for mining frequent rooted trees and free trees using canonical forms", In Proc. of the 16th International Conference on Scientific and Statistical Database Management, Santorini Island, Greece, 2004.
5. M.J. Zaki, "Efficiently Mining Frequent Embedded Unordered Trees", Fundamenta Informaticae 65, IOS Press, 2005, pp. 1-20.
6. A. Termier, M-C. Rousset, and M. Sebag, "Treefinder: A First Step Towards XML Data Mining" In Proc. of IEEE ICDM'02, 2002.
7. th International Conference on Data Engineering, 2004.
8. H. Tan, T.S. Dillon, F. Hadzic, E. Chang, and L. Feng, "MB3 Miner: mining eMBedded sub-TREEs using Tree Model Guided candidate generation", In Proc. of the 1st International Workshop on Mining Complex Data, held in conjunction with ICDM'05, Houston, Texas, USA, 2005.
9. H. Tan, T.S. Dillon, F. Hadzic, L. Feng, and E. Chang, "Tree Model Guided Candidate Generation for Mining Frequent Subtrees from XML", Submitted to Transactions on Knowledge Discovery from Data (TKDD), January, 2006, unpublished.
10. H. Tan, T.S. Dillon, F. Hadzic, L. Feng, and E. Chang, "IMB3 Miner: Mining Induced/Embedded Subtrees by Constraining the Level of Embedding", In Proc. of PAKDD'06, Singapore, 2006.
11. H. Tan, T.S. Dillon, F. Hadzic, E. Chang, and L. Feng, "Mining induced/embedded subtrees using the level of embedding constraint", Submitted to Knowledge and Information Systems An International Journal, Springer, 2006, unpublished.
12. Tan, H., Dillon, T.S., Hadzic, F , and Chang, E., 2006. "Distance constrained mining of embedded subtrees", Workshop on Ontology Mining and Knowledge Discovery from Semistructured documents (MSD 2006), in conjunction with the 2006 International Conference on Data Mining, 18-22 December, Hong Kong, in press.
13. F. Hadzic, T.S. Dillon, A. Sidhu, E. Chang, and H. Tan, "Mining Substructures in Protein Data", IEEE ICDM 2006 Workshop on Data Mining in Bioinformatics (DMB 2006), in conjunction with the 2006 International Conference on Data Mining, 18-22 December, Hong Kong, in press.
14. M.J. Zaki, "Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications", In IEEE Transactions on Knowledge and Data Engineering, 17, 8, 2005, 1021-1035.
15. R. Agrawal, and R. Srikant, "Fast algorithm for mining association rules", In Proceedings of the 20th Very Large Data Bases (VLDB 1994), Santiago de Chile, Chile, 1994, pp. 487-499.
16. G., Valentine, Algorithms on Trees and Graphs, Springer-Verlag, Berlin, 2002.