Razor: Mining distance-constrained embedded subtrees

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 8-13

  Tan, Henry ^a   Dillon, Tharam S ^a   Hadzic, Fedja ^a   Chang, Elizabeth ^b  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b CURTIN UNIVERSITY   (Australia)

Author keywords

Association mining; Embedded subtree; Frequent subtree mining; Mining with constraints; Structure matching

Indexed keywords

EMBEDDED SYSTEMS; EMBEDDINGS; FORESTRY; ONTOLOGY;

ASSOCIATION MINING; CANDIDATE GENERATION; DISTANCE INFORMATION; FREQUENT SUBTREE MINING; REAL-WORLD DATASETS; STRUCTURE MATCHING; SUB TREES; WEB INFORMATION SYSTEMS;

DATA MINING;

EID: 78449309593     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icdmw.2006.138     Document Type: Conference Paper

References (15)

1. K. Abe, S. Kawasoe, T. Asai, H. Arimura, and S. Arikawa, "Optimized substructure discovery for semistructured data", In Proc. of the 6th European Conference on Principles of Data Mining and Knowledge Discovery, Helsinki, Finland, 2002, pp. 1-14.
2. R. Agrawal, and R. Srikant, "Fast Algorithm for Mining Association Rules", Proc. of the 20th VLDB'94, 1994, 487-499.
3. 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.
4. F. Giunchiglia, and P. Shvaiko, "Semantic matching", Ontologies and Distributed Systems workshop, IJCAI (2003).
5. Gómez-Pérez, A., Fernández-López, M. and Corcho, O. Ontological engineering: with examples from the areas of knowledge management, e-commerce and the semantic Web. Springer-Verlag, London, 2003.
6. J. Madhavan, P.A. Bernstein, and E. Rahm, "Generic Schema Matching with Cupid", In Proceedings of the International Conference on very Large Data Bases (VDLB), Rome, Italy, 2001, pp. 49-58.
7. S. Melnik, H. Molina-Garcia, and E. Rahm, "Similarity flooding: a versatile graph matching algorithm", In Proc. of ICDE-02, 2002.
8. S. Nijssen, 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.
9. N.F. Noy, and M. Musen, "An Algorithm for Merging and Aligning Ontologies: Automation and Tool Support", In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI99), Workshop on Ontology Management, Orlando, FL, 1999.
10. U. Ruckert, and S. Kramer, "Frequent free tree discovery in graph data", In Proc. of the 2004 ACM symposium on Applied computing, Nicosia, Cyprus, 2004, pp. 564-570.
11. H. Tan, T.S. Dillon, L. Feng, E. Chang, and F. Hadzic, "X3 Miner: mining patterns from XML Database", In Proc. of Data Mining '05, Skiathos, Greece, 2005.
12. 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.
13. 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.
14. Y. Xiao, J.-F. Yao, Z. Li, and M.H. Dunham, "Efficient data mining for maximal frequent subtrees", In Proc. of the 3rd IEEE International Conference on Data Mining (ICDM 2003), Melbourne, Florida, USA, 2003, pp. 379-386.
15. M.J. Zaki, "Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications", In IEEE Transaction on Knowledge and Data Engineering, 17, 8, 2005, pp. 1021-1035.