Abstract
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector representation. After all pairwise similarities between concepts have been calculated we apply well-known graph algorithms to obtain an optimal matching. Our algorithm is also capable of using existing mappings to a third ontology as training data to improve accuracy. We compare the performance of our algorithm with the performance of other alignment algorithms and show that our algorithm can compete well against the current state-of-the-art.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Cohen, W.W., Ravikumar, P., Fienberg, S.E.: A comparison of string distance metrics for name-matching tasks. In: Proceedings of the IJCAI 2003 Workshop on Information Integration on the Web (IIWeb 2003), pp. 73–78 (2003)
Ehrig, M., Staab, S.: QOM – quick ontology mapping. In: 3rd International Semantic Web Conference, Hiroshima, Japan (2004)
Euzenat, J.: An API for ontology alignment. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 698–712. Springer, Heidelberg (2004)
Euzenat, J., Loup, D., Touzani, M., Valtchev, P.: Ontology alignment with OLA. In: Sure, Y., Corcho, O., Euzenat, J., Hughes, T. (eds.) Proceedings of the 3rd International Workshop on Evaluation of Ontology based Tools (EON), Hiroshima, Japan (2004)
Euzenat, J., Stuckenschmidt, H., Yatskevich, M.: Introduction to the ontology alignment evaluation 2005. In: K-CAP 2005 Integrating Ontologies Workshop, Banff, Alberta, Canada (2005)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly (1962)
Heß, A.: Supervised and Unsupervised Ensemble Learning for the Semantic Web. Ph.D thesis, School of Computer Science and Informatics, University College Dublin, Dublin, Ireland (2005)
Heß, A., Kushmerick, N.: Iterative ensemble classification for relational data: A case study of semantic web services. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS, vol. 3201, pp. 156–167. Springer, Heidelberg (2004)
Wei, H., Ningsheng, J., Yuzhong, Q., Qanbing, W.: GMO: A graph matching for ontologies. In: K-CAP 2005 Integrating Ontologies Workshop, Banff, Alberta, Canada (2005)
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR 163(4), 845–848 (1965) (in Russian); English Translation in Soviet Physics Doklady 10(8), 707–710 (1966)
Madhavan, J., Bernstein, P.A., Rahm, E.: Generic Schema Matching with Cupid. In: Proceedings of the 27th International Conference on Very Large Databases, Rome, Italy, pp. 129–138 (2001)
Melnik, S., Molina-Garcia, H., Rahm, E.: Similariy flooding: A versatile graph matching algorithm. In: Int. Conference on Data Engineering (ICDE) (2002)
Munkres, J.: Algorithms for the assignment and transportation problems. SIAP 5(1), 32–38 (1957)
Neville, J., Jensen, D.: Iterative classification in relational data. In: AAAI Workshop Statistical Relational Learning (2000)
Sure, Y., Corcho, O., Euzenat, J., Hughes, T. (eds.): 3rd Int. Workshop on Evaluation of Ontology based Tools (EON), Hiroshima, Japan (2004)
Winkler, W.E., Thibaudeau, Y.: An application of the Fellegi-Sunter model of record linkage to the 1990 U.S. decennial census. Technical report, U.S. Bureau of the Census, Washington, D.C., Statistical Research Report Series RR91/09 (1991)
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
Heß, A. (2006). An Iterative Algorithm for Ontology Mapping Capable of Using Training Data. In: Sure, Y., Domingue, J. (eds) The Semantic Web: Research and Applications. ESWC 2006. Lecture Notes in Computer Science, vol 4011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11762256_5
Download citation
DOI: https://doi.org/10.1007/11762256_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34544-2
Online ISBN: 978-3-540-34545-9
eBook Packages: Computer ScienceComputer Science (R0)