基于WordNet和二分图的语义Web服务发现算法  

Semantic Web service discovery Algorithm based on WordNet and bipartite graph

作　　者：华建新[1] 曹敦[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,湖南长沙410076

出　　处：《微计算机信息》2010年第24期198-200,共3页Control & Automation

基　　金：湖南省科技计划项目(2009SK4006)

摘　　要：由于Web服务的描述参数都是有顺序的,而服务提供者和用户之间缺少对服务的共同语义描述约束,服务请求的描述参数都是无序的,它们之间不能直接进行匹配调用。本文在OWL-S的基础上利用WordNet计算参数的相似度,最后引入二分图来解决这一不对称匹配问题。实验结果表明本文算法有较好查准率和查全率,同时本文算法易于实现。Because the parameters which described of web services are in order,there exists the lack of a common semantic describing constraints between providers and users of web services,Parameters which described of the request is disorderly,they can not be used directly matching others.This paper adopts WordNet to calculate the similarity of the parameters based on OWL-S and quotes bipartite graph to solve the problem of asymmetric matching in the end.The experimental results show that the precision ratio and recall ratio of this algorithm is better than others and it is easy to implement this algorithm at the same time.

关 键 词：WEB服务 服务发现 WORDNET 二分图 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]