[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

S-Match: an Algorithm and an Implementation of Semantic Matching

  • Conference paper
The Semantic Web: Research and Applications (ESWS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3053))

Included in the following conference series:

Abstract

We think of Match as an operator which takes two graph-like structures (e.g., conceptual hierarchies or ontologies) and produces a mapping between those nodes of the two graphs that correspond semantically to each other. Semantic matching is a novel approach where semantic correspondences are discovered by computing, and returning as a result, the semantic information implicitly or explicitly codified in the labels of nodes and arcs. In this paper we present an algorithm implementing semantic matching, and we discuss its implementation within the S-Match system. We also test S-Match against three state of the art matching systems. The results, though preliminary, look promising, in particular for what concerns precision and recall.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. Bergamaschi, S., Castano, S., Vincini, M.: Semantic Integration of Semistructured and Structured Data Sources. SIGMOD Record 28(1), 54–59 (1999)

    Article  Google Scholar 

  2. Do, H.H., Rahm, E.: COMA – A System for Flexible Combination of Schema Matching Approach. In: Proceedings of VLDB 2002, pp. 610–621 (2002)

    Google Scholar 

  3. Doan, A., Madhavan, J., Domingos, P., Halvey, A.: Learning to map between ontologies on the semantic web. In: Proceedings of WWW 2002, pp. 662–673 (2002)

    Google Scholar 

  4. Giunchiglia, F.: Contextual reasoning. Epistemologia, special issue on “Linguaggi e le Macchine” XVI, 345–364 (1993)

    Google Scholar 

  5. Giunchiglia, F., Shvaiko, P.: Semantic Matching. To appear in “The Knowledge Engineering Review” journal 18(3), Short versions: Proceedings of Ontologies and distributed systems workshop at IJCAI 2003 and Semantic Integration workshop at ISWC 2003 (2003)

    Google Scholar 

  6. Giunchiglia, F., Zaihrayeu, I.: Making peer databases interact - a vision for an architecture supporting data coordination. In: Klusch, M., Ossowski, S., Shehory, O. (eds.) CIA 2002. LNCS (LNAI), vol. 2446, pp. 18–35. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Giunchiglia, F., Zaihrayeu, I.: Implementing database coordination in P2P networks. Submitted to ESWS 2004 (2004)

    Google Scholar 

  8. Do, H.H., Melnik, S., Rahm, E.: Comparison of schema matching evaluations. In: Proceedings of workshop on Web and Databases (2002)

    Google Scholar 

  9. Kang, J., Naughton, J.F.: On schema matching with opaque column names and data values. In: Proceedings of SIGMOD 2003, pp. 205–216 (2003)

    Google Scholar 

  10. Le Berre, D.: JSAT: The java satisfiability library (2001), http://cafe.newcastle.edu.au/daniel/JSAT/

  11. Madhavan, J., Bernstein, P., Rahm, E.: Generic schema matching with Cupid. In: Proceedings of VLDB 2001, pp. 49–58 (2001)

    Google Scholar 

  12. Magnini, B., Serafini, L., Speranza, M.: Making Explicit the Semantics Hidden in Schema Models. In: Proceedings of workshop on Human Language Technology for the Semantic Web and Web Services at ISWC 2003 (2003)

    Google Scholar 

  13. Melnik, S., Rahm, E., Bernstein, P.: Rondo: A programming platform for generic model management. In: Proceedings of SIGMOD 2003, pp. 193–204 (2003)

    Google Scholar 

  14. Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A Versatile Graph Matching Algorithm. In: Proceedings of ICDE, pp. 117–128 (2002)

    Google Scholar 

  15. Miller, A.G.: Wordnet: A lexical database for English. Communications of the ACM 38(11), 39–41 (1995)

    Article  Google Scholar 

  16. Rahm, E., Bernstein, P.: A survey of approaches to automatic schema matching. VLDB Journal 10(4), 334–350 (2001)

    Article  MATH  Google Scholar 

  17. Serafini, L., Bouquet, P., Magnini, B., Zanobini, S.: Semantic Coordination: A new approach and an application. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 130–145. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Xu, L., Embley, D.W.: Using domain ontologies to discover direct and indirect matches for schema elements. In: Proceedings of Semantic Integration workshop at ISWC 2003 (2003)

    Google Scholar 

  19. Yatskevich, M.: Preliminary Evaluation of Schema Matching Systems. DIT Technical Report, DIT-03-028 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giunchiglia, F., Shvaiko, P., Yatskevich, M. (2004). S-Match: an Algorithm and an Implementation of Semantic Matching. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds) The Semantic Web: Research and Applications. ESWS 2004. Lecture Notes in Computer Science, vol 3053. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25956-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25956-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21999-6

  • Online ISBN: 978-3-540-25956-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics