Anchor-Prior: An Effective Algorithm for Ontology Integration

초록

Most previous studies of ontology integration have simply involved blind or exhaustive matching among all concepts across ontologies. Therefore, the computational complexity of integrating two ontologies is O(n2). In addition, semantic mismatches, logical inconsistencies and conceptual conflicts in ontology integration have not yet become avoidable. The main contribution of the approach presented here is to reduce the computational complexity and to enhance the accuracy of ontology integration. The key idea of this approach is to start from an Anchor (two matched concepts) to work towards a collection of matched pairs among its neighboring concepts by computing similarities between the priorly