Inexact matching of ontology graphs using expectation-maximization

  • Authors:

  • Prashant Doshi;Ravikanth Kolli;Christopher Thomas

  • Affiliations:

  • LSDIS Lab, Dept. of Computer Science, University of Georgia, Athens, GA 30602, United States;LSDIS Lab, Dept. of Computer Science, University of Georgia, Athens, GA 30602, United States;Kno.e.sis Center, Dept. of Computer Science and Engineering, Wright State University, Dayton, OH 45435, United States

  • Venue:
  • Web Semantics: Science, Services and Agents on the World Wide Web
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new method for mapping ontology schemas that address similar domains. The problem of ontology matching is crucial since we are witnessing a decentralized development and publication of ontological data. We formulate the problem of inferring a match between two ontologies as a maximum likelihood problem, and solve it using the technique of expectation-maximization (EM). Specifically, we adopt directed graphs as our model for ontology schemas and use a generalized version of EM to arrive at a map between the nodes of the graphs. We exploit the structural, lexical and instance similarity between the graphs, and differ from the previous approaches in the way we utilize them to arrive at, a possibly inexact, match. Inexact matching is the process of finding a best possible match between the two graphs when exact matching is not possible or is computationally difficult. In order to scale the method to large ontologies, we identify the computational bottlenecks and adapt the generalized EM by using a memory bounded partitioning scheme. We provide comparative experimental results in support of our method on two well-known ontology alignment benchmarks and discuss their implications.