A conceptual graph approach to semantic similarity computation method for e-service discovery Online publication date: Thu, 08-Apr-2010
by William Song, Xiaofeng Du, Malcolm Munro
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 1, No. 1, 2010
Abstract: E-services are services that make themselves available on the web and can be invoked over the internet. These services can be composed together to form new services. With the great growth of the number of services on the web it is indispensable to adopt an effective and efficient way to discover and compose them to meet the users' requirements. However, current web services description languages such as WSDL and OWL-S do not provide semantic support for automatic search and composition of services. In this paper, based on the Conceptual Graph theory, we propose a contextual based conceptual model for automatic search and match for services using two kinds of contextual information – service characteristics and inter-service semantic relations. We explore the theoretical models for inter-service and service characteristics semantic similarity computation to match users' service queries and based on the conceptual model we present an effective service matching algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Data Mining (IJKEDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook