Skip to main content

Partial Ontology Matching Using Instance Features

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2009 (OTM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5871))

  • 680 Accesses

Abstract

Ontologies are a useful model to express semantics in a machine-readable way. A matching of heterogeneous ontologies is often required for many different applications like query answering or ontology integration. Many systems coping with the matching problem have been developed in the past, most of them using meta information like concept names as a basis for their calculations. This approach works well as long as the pieces of meta information are similar. In case of very differently structured ontologies or if a lot of possible synonyms, homonyms or meaningless meta information are used, the recognition of mappings gets difficult. In these cases instance-based matching methods are a useful extension to find additional correct mappings resulting in an improved matching quality, because instances provide a lot of information about a concept. This paper presents a novel instance-based matching algorithm which calculates different features using instances. These features characterize the concepts and are compared using different similarity functions. Finally, the similarity values are used to determine 1:1 mapping proposals.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bilke, A., Naumann, F.: Schema matching using duplicates. In: Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, Tokyo, Japan, April 5-8, 2005, pp. 69–80 (2005)

    Google Scholar 

  2. The DBLP Computer Science Bibliography (June 2008), http://www.informatik.uni-trier.de/~ley/db/

  3. Doan, A., Madhavan, J., Domingos, P., Halevy, A.Y.: Ontology Matching: A Machine Learning Approach. In: Handbook on Ontologies, pp. 385–404. Springer, Heidelberg (2004)

    Google Scholar 

  4. Engmann, D., Maßmann, S.: Instance Matching with COMA++. In: Workshop Proceedings of Datenbanksysteme in Business, Technologie und Web (BTW 2007), Aachen, Germany, March 5–6 (2007)

    Google Scholar 

  5. Euzenat, J., Shvaiko, P.: Ontology matching. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  6. Ontology Aligment Evaluation Initiative - 2007 Campaign (2007), http://oaei.ontologymatching.org/2007/

  7. Biron, P.V., Malhotra, A.: XML Schema Part 2: Datatypes, 2nd edn (2007), http://www.w3.org/TR/xmlschema-2/#built-in-datatypes

  8. Zaiß, K., Conrad, S.: Instance-Based Ontology Matching Using Different Kinds of Formalisms. In: Proceedings of the International Conference on Semantic Web Engineering, Oslo, Norway, July 29-31, vol. 55, pp. 164–172 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zaiß, K., Conrad, S. (2009). Partial Ontology Matching Using Instance Features. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2009. OTM 2009. Lecture Notes in Computer Science, vol 5871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05151-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05151-7_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05150-0

  • Online ISBN: 978-3-642-05151-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics