A Conceptual Graph Based Approach to Ontology Similarity Measure

摘要

This paper presents a combinatorial, structure based approach to the problem of finding a (di)similarity measure between two Conceptual Graphs. With a growing number of ontologies and an increasing need for quick, on the fly knowledge integration and querying, ontology similarity measures are essential for building the foundations of the Semantic Web. Conceptual Graphs benefit from a graph based representation that can be exploited in versatile optimisation techniques. We propose a disimilarity measure based on the content and the structure of two graphs. This disimilarity measure is based on the clique number of the matching graph, a combinatorial structure which encodes the two graphs projection information.