| Summary: | Knowledge matching is an important problem for many emerging applications in many areas including scientific knowledge management, ontology matching, e-commerce, and enterprise application integration. Matching the concepts of heterogeneous knowledge representations is very challenging due to the difficulty of taking contextual information into account and detecting complex matches. In this chapter, we describe a knowledge matching approach that uses subtree patterns to utilize structural information for matching at the conceptual and structural level. Initially, the algorithm does not take any syntactic information into account, but rather forms candidate mappings according to their structural/contextual relationships in the knowledge structures, which are then validated using online dictionaries and string similarity measures. The approach will then automatically extract the knowledge structure that is shared among all the matched knowledge representations. Experimental evaluation is performed on a number of real world XML schemas, which demonstrates the effectiveness of the proposed approach.
|
|---|