An effective ontology matching technique

Authors:
Ahmed Alasoud;Volker Haarslev;Nematollaah Shiri
Affiliations:
Computer Science & Software Engineering, Concordia University, Montreal, Quebec, Canada;Computer Science & Software Engineering, Concordia University, Montreal, Quebec, Canada;Computer Science & Software Engineering, Concordia University, Montreal, Quebec, Canada
Venue:
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Year:
2008

Citing 4
Cited 3

Comparison of Schema Matching Evaluations

Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
WordNet: similarity - measuring the relatedness of concepts

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A method for recommending ontology alignment strategies

ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
A multi-level matching algorithm for combining similarity measures in ontology integration

ODBIS'05/06 Proceedings of the First and Second VLDB conference on Ontologies-based databases and information systems

An empirical comparison of ontology matching techniques

Journal of Information Science
On-the-fly ontology matching in smart spaces: a multi-model approach

ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
Six Scenarios of Exploiting an Ontology Based, Mobilized Learning Environment

International Journal of Mobile and Blended Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the ontology matching problem and propose an algorithm, which uses as a backbone a multi-level matching technique and performs a neighbor search to find the correspondences between the entities in the given ontologies. A main feature of this algorithm is the high quality of the matches it finds. Besides, as the result of the initial search introduced, our algorithm converges fast, making it comparable to existing techniques.