基于属性权重和粗糙集的网格服务发现算法  

Grid service discovery algorithm based on attribute weight and rough set

作　　者：赵旭[1] 黄永忠[1] 安留洋[1] 

机构地区：[1]信息工程大学信息工程学院,郑州450002

出　　处：《计算机应用》2012年第1期167-169,共3页journal of Computer Applications

基　　金：国家863计划项目(2009AA012417)

摘　　要：针对网格服务发现中发现效率低的问题,基于本体技术及知识表示系统和决策表的理论,提出一种优化的考虑服务属性权重的服务发现算法。通过对服务调用历史记录的规则抽取和属性权重计算,给出了包含信息预处理、粗糙集服务匹配的两个阶段服务发现算法实现,并分别从查准率和查全率两个方面进行了理论分析和实验验证。结果表明,所提算法有较高的查全率和查准率;同时,候选服务的排序结果更符合用户的需求。To solve the low efficiency problem of grid service discovery,based on ontology technology,the theory of decision table,and knowledge representation system of rough sets,the paper put forward an optimized service discovery algorithm that considered the weight of the service properties.By rule extraction of the service invocation history and the calculation of the service properties weight,two main phases of the service discovery algorithm： information pre-processing and rough set service matching could be achieved.This article also gave theoretical analysis and experimental verification on both precision rate and recall rate.The results show that the proposed algorithm can provide higher precision and recall rate;besides,the ranking results of the candidate services are more preferable.

关 键 词：网格服务 粗糙集理论 属性权重 服务发现算法 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术] TP393.028[自动化与计算机技术—计算机科学与技术]