loading...
Semantic Matching to Achieve Web Service Discovery and Composition
San Francisco, CA June 26-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CEC-EEE.2006.78The 8th IEEE International Conference ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rama Akkiraju, IBM T. J. Watson Research Center, NY
Anca Ivan, IBM T. J. Watson Research Center, NY
Richard Goodwin, IBM T. J. Watson Research Center, NY
Biplav Srivastava, IBM India Research Laboratory, Block 1, IIT Campus, Hauz Khaus, New Delhi, India
Tanveer Syeda-Mahmood, IBM Almaden Research Center, 650 Harry Road, San Jose, CA
In this paper, we present a novel algorithm to discover and compose web services in the presence of semantic ambiguity by combining semantic matching and AI planning algorithms. Specifically, we use cues from domain-independent and domain-specific ontologies to compute an overall semantic similarity score between ambiguous terms. This semantic similarity score is used by AI planning algorithms to guide the searching process when composing services. In addition, we integrate semantic and ontological matching with an indexing method, which we call attribute hashing, to enable fast lookup of semantically related concepts.
Citation:
Rama Akkiraju, Anca Ivan, Richard Goodwin, Biplav Srivastava, Tanveer Syeda-Mahmood, "Semantic Matching to Achieve Web Service Discovery and Composition," cec-eee, pp.70, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions