Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baget, J.-F., Carloni, O., Chein, M., Genest, D., Gutirrez, A., Leclere, M., Mugnier, M.-L., Salvat, E., Thomopuolos, R.: Towards benchmarks for conceptual graph tools. In: de Moor, A., Polovina, S., Delugach, H. (eds.) First Conceptual Structures Tool Interoperability Workshop, pp. 72–87. Aalborg University Press (2006)
Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Scientific Am., pp. 28–37 (May 2001)
Chein, M., Mugnier, M.-L.: Conceptual graphs: Fundamental notions. Revue d’Intelligence Artificielle 6(4), 365–406 (1992)
Chein, M., Mugnier, M.-L., Simonet, G.: Nested graphs: A graph-based knowledge representation model with FOL semantics. In: KR 1998. Proc. of the 6th Int’l Conf. on the Principles of Knowl. Repres. and Reasoning, pp. 524–535. Morgan Kaufmann, San Francisco (1998)
Croitoru, M., Compatangelo, E.: A combinatorial approach to conceptual graph projection checking. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 130–143. Springer, Heidelberg (2004)
Croitoru, M., Compatangelo, E.: Conceptual graph projection: a tree decomposition-based approach. In: Doherty, P., Mylopuolos, Welty, C. (eds.) KR 2006. Proc. of the 10th Int’l Conf. on the Principles of Knowledge Representation and Reasoning, pp. 271–276. AAAI, Stanford, California, USA (2006)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Delugach, H.: An Exploration into Semantic Distance. In: Proc. of the 7th Int’l Conf. on W’shop on Conceptual Graphs, pp. 119–124 (1992)
Montes-Y-Gomez, M., Gelbukh, A., Lopez-Lopez, A., Baeza-Yates, R., Mayr, C., Lazansky, J., quirchmayr, G., Vogel, P.: Flexible comparison of conceptual graphs. In: Proc of the 12th Intln Conference on Database and Expert Systems Applications. LNCS, pp. 102–111. Springer, Heidelberg (2001)
Myaeng, S.H., Lopez-Lopez, A.: Conceptual graph matching: A flexible algorithm and experiments. Jour. of Exp. and Theor. Comp. Sci. 4, 107–126 (1992)
Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, London, UK (1984)
W3C RDF Primer. RDF Primer — W3C Recommendation 10/2/2004 (2004)
World Wide Web Consortium. Web Ontology language (OWL), current (August 2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Croitoru, M., Hu, B., Dashmapatra, S., Lewis, P., Dupplaw, D., Xiao, L. (2007). A Conceptual Graph Based Approach to Ontology Similarity Measure. In: Priss, U., Polovina, S., Hill, R. (eds) Conceptual Structures: Knowledge Architectures for Smart Applications. ICCS 2007. Lecture Notes in Computer Science(), vol 4604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73681-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-73681-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73680-6
Online ISBN: 978-3-540-73681-3
eBook Packages: Computer ScienceComputer Science (R0)