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.

[1]  Chantal Reynaud,et al.  TaxoMap in the OAEI 2009 Alignment Contest , 2009, OM.

[2]  Jürgen Bock,et al.  MapPSO Results for OAEI 2009 , 2009, OM.

[3]  Erhard Rahm,et al.  Similarity flooding: a versatile graph matching algorithm and its application to schema matching , 2002, Proceedings 18th International Conference on Data Engineering.

[4]  Pedro M. Domingos,et al.  Learning to map between ontologies on the semantic web , 2002, WWW '02.

[5]  Avigdor Gal,et al.  Managing Uncertainty in Schema Matcher Ensembles , 2007, SUM.

[6]  Mark A. Musen,et al.  PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment , 2000, AAAI/IAAI.

[7]  Erhard Rahm,et al.  Comparison of Schema Matching Evaluations , 2002, Web, Web-Services, and Database Systems.

[8]  Kathleen M. Fisher,et al.  Mapping Biology Knowledge , 2000 .

[9]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[10]  Anuj R. Jaiswal,et al.  OMEN: A Probabilistic Ontology Mapping Tool , 2005, SEMWEB.

[11]  Mansur R. Kabuka,et al.  ASMOV Results for OAEI 2007 , 2007, OM.

[12]  Eduard Hovy,et al.  Combining and standardizing large- scale, practical ontologies for machine tranlation and other uses , 1998, LREC.

[13]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[14]  Feng Shi,et al.  RiMOM Results for OAEI 2009 , 2008, OM.

[15]  Marta Sabou,et al.  Spider: Bringing Non-equivalence Mappings to OAEI , 2008, OM.

[16]  Enrico Motta,et al.  DSSim - Managing Uncertainty on the Semantic Web , 2007, OM.

[17]  Jérôme David,et al.  AROMA Results for OAEI 2009 , 2008, OM.

[18]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[19]  Robert P. Goldman,et al.  A Bayesian Model of Plan Recognition , 1993, Artif. Intell..

[20]  Qiang Liu,et al.  SAMBO and SAMBOdtf Results for the Ontology Alignment Evaluation Initiative 2008 , 2008, OM.

[21]  Mark A. Musen,et al.  Anchor-PROMPT: Using Non-Local Context for Semantic Matching , 2001, OIS@IJCAI.

[22]  Stefan Decker,et al.  A Scalable Framework for the Interoperation of Information Sources , 2001, SWWS.

[23]  Eduardo Mena,et al.  Ontology Matching with CIDER: Evaluation Report for the OAEI 2008 , 2008, OM.

[24]  Natalya F. Noy Using Non-Local Context for Semantic Matching , 2001, IJCAI 2001.

[25]  Baowen Xu,et al.  Lily: Ontology Alignment Results for OAEI 2008 , 2008, OM.

[26]  X. Jin Factor graphs and the Sum-Product Algorithm , 2002 .

[27]  Lise Getoor,et al.  Combining statistical and logical inference for ontology alignment , 2006 .

[28]  Matthias Jarke,et al.  GeRoMe: A Generic Role Based Metamodel for Model Management , 2005, J. Data Semant..

[29]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[30]  Chantal Reynaud,et al.  TaxoMap in the OAEI 2008 Alignment Contest , 2008, OM.