• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

QOM – Quick ontology mapping (2004)

Cached

  • Download as a PDF

Download Links

  • [www.uni-koblenz.de]
  • [userpages.uni-koblenz.de]
  • [userpages.uni-koblenz.de]
  • [se-pubs.dbs.uni-leipzig.de]
  • [www.aifb.uni-karlsruhe.de]
  • [people.scs.carleton.ca]
  • [www.aifb.uni-karlsruhe.de]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Marc Ehrig , Steffen Staab
Venue:In Proc. 3rd International Semantic Web Conference (ISWC04
Citations:150 - 10 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Ehrig04qom–,
    author = {Marc Ehrig and Steffen Staab},
    title = {QOM – Quick ontology mapping},
    booktitle = {In Proc. 3rd International Semantic Web Conference (ISWC04},
    year = {2004},
    pages = {683--697},
    publisher = {Springer}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Abstract. (Semi-)automatic mapping — also called (semi-)automatic alignment — of ontologies is a core task to achieve interoperability when two agents or services use different ontologies. In the existing literature, the focus has so far been on improving the quality of mapping results. We here consider QOM, Quick Ontology Mapping, as a way to trade off between effectiveness (i.e. quality) and efficiency of the mapping generation algorithms. We show that QOM has lower run-time complexity than existing prominent approaches. Then, we show in experiments that this theoretical investigation translates into practical benefits. While QOM gives up some of the possibilities for producing high-quality results in favor of efficiency, our experiments show that this loss of quality is marginal. 1

Keyphrases

qom quick ontology mapping    automatic alignment    core task    high-quality result    automatic mapping    mapping generation algorithm    quick ontology mapping    practical benefit    run-time complexity    different ontology    prominent approach    theoretical investigation   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University