A conceptual graph approach to semantic similarity computation method for e-service discovery
A conceptual graph approach to semantic similarity computation method for e-service discovery
复制标题
DOI：
10.1504/ijkedm.2010.032580
复制
发表时间：
2010-04
期刊：
影响因子：
--
通讯作者：
William W. Song;Xiaofeng Du;M. Munro
中科院分区：
文献类型：
--
作者：
William W. Song;Xiaofeng Du;M. Munro
电子服务是在网络上提供的服务，可以在互联网上调用。这些服务可以组合在一起形成新的服务。随着网络服务数量的快速增长，采用一种有效的方法来发现和组合服务以满足用户的需求是必不可少的。然而，当前的web服务描述语言（如WSDL和OWL-S）并不为服务的自动搜索和组合提供语义支持。本文在概念图理论的基础上，利用服务特征和服务间语义关系两种上下文信息，提出了一种基于上下文的服务自动搜索和匹配概念模型。探讨了服务间和服务特征语义相似度计算的理论模型，并在此基础上提出了一种有效的服务匹配算法。
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.