Eyal Shlomo Shimony

Senior Academic

Markov network based ontology matching

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.

Publication language English
Pages 105-118
Journal Journal of Computer and System Sciences
Volume 78
Issue number 1
Publication status Published - 01.01.2012

Keywords

Markov networks
Ontology matching
Probabilistic reasoning

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
Computer Networks and Communications
Computational Theory and Mathematics
Applied Mathematics
Access to Document
10.1016/j.jcss.2011.02.014
Other files and links
Link to publication in Scopus