Abstract
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 OpenKnowledge project has produced an implementation that demonstrates this is possible in a fully peer-to-peer environment.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barker, A., Mann, B.: Agent-based scientific workflow composition. In: Díaz, J., Orejas, F. (eds.) CAAP 1989 and TAPSOFT 1989. LNCS, vol. 351, pp. 485–488. Springer, Heidelberg (1989)
Besana, P., Robertson, D.: Probabilistic dialogue models for dynamic ontology mapping. In: Fensel, D., Sycara, K.P., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, Springer, Heidelberg (2003)
Cohen, P.R., Levesque, H.J: Rational interaction as the basis for communication. Intentions in Communication, 221–256 (1990)
Do, H.H., Rahm, E.: Coma - a system for flexible combination of schema matching approaches. In: VLDB, pp. 610–621 (2002)
Doan, A., Madhavan, J., Dhamankarse, R., Domingos, P., Halevy, A.: Learning to match ontologies on the semantic web. The VLDB Journal 12(4), 303–319 (2003)
Ehrig, M., Staab, S.: Qom - quick ontology mapping. In: International Semantic Web Conference, pp. 683–697 (2004)
Giunchiglia, F., Shvaiko, P., Yatskevich, M.: S-match: an algorithm and an implementation of semantic match. In: Proceeding of the European Semantic Web Symposium, pp. 61–75 (2004)
Guo, L., Robertson, D., Chen-Burger, Y.: A novel approach for enacting the distributed business workflows using bpel4ws on the multi-agent platform. In: IEEE Conference on E-Business Engineering, pp. 657–664. IEEE Computer Society Press, Los Alamitos (2005)
Kalfoglou, Y., Schorlemmer, M.: Ontology mapping: the state of the art. The Knowledge Engineering Review 18(1), 1–31 (2003)
Melnik, S., H,, Garcia-Molina, E R.: Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In: ICDE 2002. Proceedings of the 18th International Conference on Data Engineering, p. 117 (2002)
Puhlmann, F., Weske, M.: Using the pi-calculus for formalizing workflow patterns. In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol. 3649, pp. 153–168. Springer, Heidelberg (2005)
Reithinger, N., Engel, R., Kipp, M., Klesen, M.: Predicting dialogue acts for a speech-to-speech translation system. In: Proc. ICSLP 1996, vol. 2, pp. 654–657 (1996)
Robertson, D.: A lightweight coordination calculus for agent systems. In: Declarative Agent Languages and Technologies, pp. 183–197 (2004)
Searle, J.R.: Speech acts: an essay in the philosophy of language. Cambridge University Press, Cambridge (1969)
Shvaiko, P., Euzenat, J.: A survey of schema-based matching approaches. Journal on Data Semantics 4, 146–171 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besana, P., Robertson, D. (2007). How Service Choreography Statistics Reduce the Ontology Mapping Problem. In: Aberer, K., et al. The Semantic Web. ISWC ASWC 2007 2007. Lecture Notes in Computer Science, vol 4825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76298-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-76298-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76297-3
Online ISBN: 978-3-540-76298-0
eBook Packages: Computer ScienceComputer Science (R0)