Criteria-Based Approximate Matching of Large-Scale Ontologies

Large ontology matching problem brings a new challenge to the state of ontology matching technology. In this paper we present a criteria-Based approximate matching approach to solve the problem. The main principle of our approach is based on fully explore semantic information hidden in ontology structures, either physically or logically, and tightly coupled element-level and structure-level features to obtain matching results. Through joining the quantitative structural information for the matching process can significantly decrease the execution time with pretty good quality.