| 一个基于概念语义近似度的Web服务匹配算法 |
| |
| 引用本文： | 邱田,李鹏飞,林品.一个基于概念语义近似度的Web服务匹配算法[J].电子学报,2009,37(2):429-432. |
| |
| 作者姓名： | 邱田 李鹏飞 林品 |
| |
| 作者单位： | 中国科学院软件研究所,北京,100190;中国科学院研究生院,北京,100190 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，中国科学院支撑技术项目 |
| |
| 摘 要： |
|
| 关 键 词： | web服务发现 UDDI OWL-S 语义匹配算法 近似度度量函数 |
| 收稿时间： | 2008-02-09 |
A Web Service Matching Algorithm Based on Semantic Similarity of Concepts |
| |
| QIU Tian,LI Peng-fei,LIN Pin.A Web Service Matching Algorithm Based on Semantic Similarity of Concepts[J].Acta Electronica Sinica,2009,37(2):429-432. |
| |
| Authors: | QIU Tian LI Peng-fei LIN Pin |
| |
| Affiliation: | 1.Institute of Software;Chinese Academy of Sciences;Beijing 100190;China;2.Graduate University of Chinese Academy of Sciences;China |
| |
| Abstract: | Web service discovery has been a key problem with the development of web services.The current service discovery standard,UDDI,has the limitation of lack of semantic inference support,and the mechanism which cannot search based on service capabilities and properties leads to a limited performance.The problem can be addressed by adopting OWL-S in web service discovery.In this paper a matching algorithm for service discovery is proposed based on semantic similarity of concepts,aiming at enhancing both recall a... |
| |
| Keywords: | UDDI OWL-S |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
