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 …