Journal
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Volume 78, Issue 1, Pages 105-118Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcss.2011.02.014
Keywords
Ontology matching; Probabilistic reasoning; Markov networks
Funding
- IMG4 consortium of the Israel Ministry of Trade and Industry
- Lynn and William Frankel Center for Computer Science
Ask authors/readers for more resources
Ontology matching is a vital step whenever there is a need to integrate and reason about overlapping domains of knowledge. Systems that automate this task are of a great need. iMatch is a probabilistic scheme for ontology matching based on Markov networks, which has several advantages over other probabilistic schemes. First, it handles the high computational complexity by doing approximate reasoning, rather then by ad-hoc pruning. Second, the probabilities that it uses are learned from matched data. Finally, iMatch naturally supports interactive semi-automatic matches. Experiments using the standard benchmark tests that compare our approach with the most promising existing systems show that iMatch is one of the top performers. (C) 2011 Published by Elsevier Inc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available