Structural matching and discovery in document databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discovering Structural Association of Semistructured Data
IEEE Transactions on Knowledge and Data Engineering
Sharing Classifiers among Ensembles from Related Problem Domains
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Tree inclusion algorithm, signatures and evaluation of path-oriented queries
Proceedings of the 2006 ACM symposium on Applied computing
Mining Substructures in Protein Data
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
IMB3-Miner: mining induced/embedded subtrees by constraining the level of embedding
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Hi-index | 0.00 |
Matching of knowledge structures is generally important for scientific knowledge management, e-commerce, enterprise application integration, etc. With the desire of knowledge sharing and reuse in these fields, matching commonly occurs among different organizations on the knowledge describing the same domain. In this paper we propose a knowledge matching method which makes use of our previously developed tree mining algorithms for extracting frequent subtrees from a tree structured database. Example decision trees obtained from real world domains are used for experimentation purposes whereby some important issues that arise when extracting shared knowledge through tree mining are discussed. The potential of applying tree mining algorithms for automatic discovery of common knowledge structures is demonstrated.