基于松弛函数扩展的二分图匹配服务发现算法  

Extended bipartite graph matching service discovery algorithm based on slack function

作　　者：刘冰月[1] 张永[1] 

机构地区：[1]大连东软信息学院计算机科学与技术系,辽宁大连116023

出　　处：《计算机工程与设计》2015年第9期2427-2431,共5页Computer Engineering and Design

基　　金：国家自然科学基金重大基金项目(60496320;60496321)

摘　　要：为解决早期研究提出的基于二分图匹配的语义Web服务发现算法存在的一些问题,如该算法在寻找增广路径时使用最佳二分图匹配算法,难以找到匹配度阈值内的所有服务,影响了Web服务匹配算法的查全率和查准率,针对以上问题进行研究和分析,提出一种扩展的二分图匹配的Web服务自动发现算法,利用松弛函数值扩展等价子图来寻找新的增广路径。实验结果表明,在参数集合离差增加的情况下,该算法返回的服务匹配数量及匹配准确度基本不受影响。To resolve the problems of the ontology-based algorithm of bipartite graph matching semantic Web service discovery presented in previous research, the new algorithm was studied. In previous algorithms, the optimal bipartite graph matching was used to find augment path, leading to low recall rate and precision rate of Web service discovery. To solve these problems, an ontology-based bipartite graph matching semantic Web service discovery algorithm was proposed, which extended the optimal bi- partite graph matching algorithm. The slack function was used to find the augment path in the equivalent sub graph. Experimen- tal results show that the recall rate and precision rate of the service discovery are better than before and they are not affected when the max dispersion of parameters set size between service and query changes.

关 键 词：语义WEB服务 扩展的二分图匹配 松弛函数 等价子图 增广路径 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]