How Service Choreography Statistics Reduce the Ontology Mapping Problem

In open and distributed environments ontology mapping provides interoperability between interacting actors. However, conventional mapping systems focus on acquiring static information, and on mapping whole ontologies, which is infeasible in open systems. This paper shows that the interactions themselves between the actors can be used to predict mappings, simplifying dynamic ontology mapping. The intuitive idea is that similar interactions follow similar conventions and patterns, which can be analysed. The computed model can be used to suggest the possible mappings for the exchanged messages in new interactions. The suggestions can be evaluate by any standard ontology matcher: if they are accurate, the matchers avoid evaluating mappings unrelated to the interaction. The minimal requirement in order to use this system is that it is possible to describe and identify the interaction sequences: the Open-Knowledge project has produced an implementation that demonstrates this is possible in a fully peer-to-peer environment.

[1]  Erhard Rahm,et al.  COMA - A System for Flexible Combination of Schema Matching Approaches , 2002, VLDB.

[2]  Pedro M. Domingos,et al.  Learning to match ontologies on the Semantic Web , 2003, The VLDB Journal.

[3]  Yannis Kalfoglou,et al.  Ontology mapping: the state of the art , 2003, The Knowledge Engineering Review.

[4]  Fausto Giunchiglia,et al.  S-Match: an Algorithm and an Implementation of Semantic Matching , 2004, ESWS.

[5]  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.

[6]  Dave Robertson,et al.  Probabilistic Dialogue Models for Dynamic Ontology Mapping , 2006, URSW.

[7]  Hector J. Levesque,et al.  Rational interaction as the basis for communication , 2003 .

[8]  John R. Searle,et al.  Speech Acts: An Essay in the Philosophy of Language , 1970 .

[9]  Mathias Weske,et al.  Using the pi-Calculus for Formalizing Workflow Patterns , 2005, Business Process Management.

[10]  Jérôme Euzenat,et al.  A Survey of Schema-Based Matching Approaches , 2005, J. Data Semant..

[11]  David Stuart Robertson,et al.  A novel approach for enacting the distributed business workflows using BPEL4WS on the multi-agent platform , 2005, IEEE International Conference on e-Business Engineering (ICEBE'05).

[12]  Norbert Reithinger,et al.  Predicting dialogue acts for a speech-to-speech translation system , 1996 .

[13]  David Stuart Robertson,et al.  A Lightweight Coordination Calculus for Agent Systems , 2004, DALT.

[14]  A. Barker,et al.  Agent-Based Scientific Workflow Composition , 2006 .

[15]  Steffen Staab,et al.  QOM - Quick Ontology Mapping , 2004, GI Jahrestagung.

[16]  John Mylopoulos,et al.  The Semantic Web - ISWC 2003 , 2003, Lecture Notes in Computer Science.