How Service Choreography Statistics Reduce the Ontology Mapping Problem
P. Besana, and D. Robertson. Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea, volume 4825 of LNCS, page 43--56. Berlin, Heidelberg, Springer Verlag, (November 2007)
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.
%0 Conference Paper
%1 Besana/2007/Service
%A Besana, Paolo
%A Robertson, David
%B Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea
%C Berlin, Heidelberg
%D 2007
%E Aberer, Karl
%E Choi, Key-Sun
%E Noy, Natasha
%E Allemang, Dean
%E Lee, Kyung-Il
%E Nixon, Lyndon J B
%E Golbeck, Jennifer
%E Mika, Peter
%E Maynard, Diana
%E Schreiber, Guus
%E Cudré-Mauroux, Philippe
%I Springer Verlag
%K 2007 choreography grid_computing iswc mapping ontology ontology_(computer_science) ontology_alignment peer-to-peer problem research_12 semantic_web service statistic
%P 43--56
%T How Service Choreography Statistics Reduce the Ontology Mapping Problem
%U http://iswc2007.semanticweb.org/papers/43.pdf
%V 4825
%X 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.
@inproceedings{Besana/2007/Service,
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.},
added-at = {2007-11-07T19:13:58.000+0100},
address = {Berlin, Heidelberg},
author = {Besana, Paolo and Robertson, David},
biburl = {https://www.bibsonomy.org/bibtex/27d1f7502897d6524f38d7780dca16208/iswc2007},
booktitle = {Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea},
crossref = {http://data.semanticweb.org/conference/iswc-aswc/2007/proceedings},
editor = {Aberer, Karl and Choi, Key-Sun and Noy, Natasha and Allemang, Dean and Lee, Kyung-Il and Nixon, Lyndon J B and Golbeck, Jennifer and Mika, Peter and Maynard, Diana and Schreiber, Guus and Cudré-Mauroux, Philippe},
interhash = {5200d8c169ae7bf8e3dfc608eed448d5},
intrahash = {7d1f7502897d6524f38d7780dca16208},
keywords = {2007 choreography grid_computing iswc mapping ontology ontology_(computer_science) ontology_alignment peer-to-peer problem research_12 semantic_web service statistic},
month = {November},
pages = {43--56},
publisher = {Springer Verlag},
series = {LNCS},
timestamp = {2007-11-07T19:20:50.000+0100},
title = {How Service Choreography Statistics Reduce the Ontology Mapping Problem},
url = {http://iswc2007.semanticweb.org/papers/43.pdf},
volume = 4825,
year = 2007
}