Abstract
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of one of them and some elements of the other. A rigorous, efficient and scalable similarity measure is a pre-requisite of an ontology alignment process. This paper presents a semantic similarity measure based on a matrix represention of nodes from an RDF labelled directed graph. An entity is described with respect to how it relates to other entities using N-dimensional vectors, being N the number of selected external predicates. We adapt a known graph matching algorithm when applying this idea to the alignment of two ontologies. We have successfully tested the model with the public testcases of the Ontology Alignment Evaluation Initiative 2005.
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
Bisson, M.: Learning in fol with a similarity measure. In: Proceedings of the 10th American Association for Artificial Intelligence conference, San-Jose (CA, US), pp. 82–87 (1992)
Doan, A., Madhavan, J., Domingos, P., Halevy, A.: Learning to map between ontologies on the semantic web (2002), http://citeseer.ist.psu.edu/doan02learning.html
Ehrig, M., Euzenat, J.: Relaxed precision and recall for ontology matching, http://km.aifb.uni-karlsruhe.de/ws/intont2005/intontproceedings.pdf
Ehrig, M., Staab, S.: Qom - quick ontology mapping, http://citeseer.ist.psu.edu/727796.html
Blondel, V.D., et al.: A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Rev. 46(4), 647–666 (2004)
Hu, W., et al.: Gmo: A graph matching for ontologies. Integrating Ontologies (2005)
Euzenat, J., Valtchev, P.: Similarity-based ontology alignment in owl-lite. In: Proc. of ECAI 2004, Valencia, Spain, August 2004, pp. 333–337 (August 2004)
Hopcroft, J.E., Karp, R.M.: An O(n 5/2) algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 4, 225–231 (1973)
Leacock, C., Chodorow, M.: Combining local context and wordnet similarity for word sense identification. WordNet: An Electronic Lexical Database 49(2), 265–283 (1998)
Lee, J.H., Kim, M.H., Lee, Y.J.: Information retrieval based on conceptual distance in is-a hierarchies. Journal of Documentation 49(2), 188–207 (1993)
Ontology alignment evaluation initiative (2005), http://oaei.inrialpes.fr/2005/
Owl web ontology language overview. w3c recommendation (February 10, 2004), See: http://www.w3.org/TR/owl-features/
Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall, Inc., Upper Saddle River (1982)
Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB Journal: Very Large Data Bases 10(4), 334–350 (2001), http://citeseer.ist.psu.edu/rahm01survey.html
Resource description framework, See: http://www.w3.org/RDF/
Salton, G.: The smart retrieval system. Experiments in Automatic Document Processing (1971)
Wu, Z., Palmer, M.: Verbs semantics and lexical selection. In: Proceedings of the 32nd annual meeting on Association for Computational Linguistics, Morristown, NJ, USA, pp. 133–138. Association for Computational Linguistics (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tous, R., Delgado, J. (2006). A Vector Space Model for Semantic Similarity Calculation and OWL Ontology Alignment. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_30
Download citation
DOI: https://doi.org/10.1007/11827405_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)