一种改进的语义Web服务等级匹配算法  

An Improved Semantic Web Services Grades Matching Algorithm

作　　者：王继东[1] 张瑜[1] 戴耀文 

机构地区：[1]西北师范大学数学与信息科学学院,甘肃兰州730070 [2]平凉机电工程学校,甘肃平凉743400

出　　处：《自动化技术与应用》2010年第2期31-34,共4页Techniques of Automation and Applications

基　　金：甘肃省科技攻关计划项目(编号2GS047-A52-002-04)

摘　　要：如何快速、准确和高效地发现满足用户需求的Web服务是现阶段急需解决的关键问题之一。针对OWL-S/UDDI等级匹配算法匹配等级划分粒度太大,对同一等级内部不同情况不能加以区分的不足,提出了一种改进的匹配算法。该算法在细化匹配等级的基础上,借鉴信息检索领域查全率与查准率的思想,结合概念语义相似度的计算,以非对称的方式将离散的匹配等级转化为连续的表示方式,对同一等级内部的不同情况做出了明确的区分,提高了查询准确率。并且在服务发布时就进行匹配度的比较,实验表明该算法服务请求响应时间远小于OWL-S/UDDI等级匹配算法。One of the key problems of the Web Services is how to meet user requirement quickly and efficiently.Aiming at OWL-S/ UDDI grades matching algorithm which has large rank size of grades and do not make a distinction within same grades.The paper presented an improved algorithm.The method is on basis of level of refinement,and take advantage of recall and precision of informatin retrieval,at the same time combined with the calculation of semantic similarity to convert the discrete way into the continuous representation in the asymmetric ways,also make a distinction within same grades and improve the search accurate degree.The comparison operations have been done when the services hava been published.The experimental results show that the service response time is far less than the OWL-S/UDDI grades matching algorithm.

关 键 词：语义WEB服务 等级匹配算法 服务发现 查全率 查准率 

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