Classifications of Ontology Matching Techniques

  • Euzenat J
  • Shvaiko P
N/ACitations
Citations of this article
57Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Having defined what the matching problem is, we attempt at classifying the techniques that can be used for solving this problem. The major contributions of the previous decades are presented in Larson et al., 1989, Batini et al., 1986, Kashyap and Sheth, 1996, Parent and Spaccapietra, 1998, while the topic through the recent years have been surveyed in Rahm and Bernstein, 2001, Wache et al., 2001, Kalfoglou and Schorlemmer, 2003b. These three works address the matching problem from different perspectives (artificial intelligence, information systems, databases) and analyse disjoint sets of systems. Shvaiko and Euzenat, 2005 have attempted to consider the above mentioned works together, focusing on schema-based matching methods, and aiming to provide a common conceptual basis for their analysis. Here, we follow and extend this work on classifying matching approaches and use it in the following chapters for organising the presentation.

Cite

CITATION STYLE

APA

Euzenat, J., & Shvaiko, P. (2013). Classifications of Ontology Matching Techniques. In Ontology Matching (pp. 73–84). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-38721-0_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free