检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张孝国[1] 黄广君[1] 郭洪涛[1] 曹利红[1]
机构地区:[1]河南科技大学电子信息工程学院,河南洛阳471003
出 处:《计算机应用》2008年第4期881-883,共3页journal of Computer Applications
基 金:教育部科学技术重点资助项目(03081)
摘 要:针对现有基于语义的服务发现机制普遍对服务质量描述和服务分类考虑不够,以及匹配机制适应范围较窄、匹配效率较低的问题,进行了服务描述与服务发现技术的研究,对OWL-S规范作了一定的补充,并提出了一种基于语义的服务发现算法。以树形结构描述Web服务,按照一定策略对节点赋予不同的权值并分类存储。在服务匹配时,首先对服务请求进行预处理和领域定位,然后利用基于WordNet和HowNet的语义相似度计算方法以及一定的辅助技术实现服务匹配。实验结果表明,该服务匹配算法具有较好的查准率和查全率。Web service description and discovery technologies were researched. Then OWL-S was extended and a.Web service discovery algorithm was proposed because the presently available service discovery mechanism has weaker quality of service description, less service classification, narrower match scope and lower efficiency. Web services were described using tree structure, different weights to nodes were given according to certain strategy and services were stored by classification. Web services requests were pretreated and oriented services classifications were located firstly, then the Web services were matched by using certain semantic similarity calculation method based on WordNet or HowNet and using assistant technology. The experiments prove that this algorithm has higher precision and recall than others.
关 键 词:服务描述 权重 OWL—S 服务发现 语义相似度
分 类 号:TP391.1[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112