计算机科学 ›› 2012, Vol. 39 ›› Issue (1): 92-95.
• 软件工程 • 上一篇 下一篇
欧伟杰 曾承 韩栋 彭智勇 刘洋 马景燕 刘波
出版日期:
发布日期:
Online:
Published:
摘要: 随着互联网应用的不断丰富,如何高效而准确地发现用户所需的Web服务已成为重要的挑战。传统基于关键字和语义匹配的方法存在查全率低和效率低下的问题,无法满足实际应用。提出基于语义相似性的服务匹配算法,实现了基于层次本体的概念相似性计算,并改进了原有二分图最优匹配算法的不足。根据该算法实现了一个Web服务发现原型系统。经实验证明,该方法不仅具有较高的查全率,且算法效率是满足目前服务发现需要的。
关键词: Web服务,语义相似性,二分图匹配
Abstract: With the increasing growth of Web applications,how to discover the desired services for users efficiently becomes a significant challenge. A novel approach for service matching based on semantic similarity was proposed, which employs hierarchical ontology to compute the semantic similarity of concepts from two compared services. The maximum weight matching algorithm was improved according to the situation of Web service. The method was implemented in a prototype of service discovery. hhe experiments illustrate that our approach not only enhances the recall rate, but also meets the needs of the current service discovery.
Key words: Web service, Semantic similarity, Bipartite graph matching
欧伟杰 曾承 韩栋 彭智勇 刘洋 马景燕 刘波. 基于语义相似性的Web服务匹配算法[J]. 计算机科学, 2012, 39(1): 92-95. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2012/V39/I1/92
Cited