计算机应用 ›› 2012, Vol. 32 ›› Issue (01): 167-169.DOI: 10.3724/SP.J.1087.2012.00167

• 先进计算 • 上一篇    下一篇

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

赵旭,黄永忠,安留洋   

  1. 信息工程大学 信息工程学院,郑州 450002
  • 收稿日期:2011-06-22 修回日期:2011-08-29 发布日期:2012-02-06 出版日期:2012-01-01
  • 通讯作者: 赵旭
  • 作者简介:赵旭(1986-),男,河南郑州人,硕士研究生,主要研究方向:分布式系统、SOA、云计算;黄永忠(1968-),湖北恩施人,教授,博士,主要研究方向:分布式系统、云计算、海量信息处理;安留洋(1985-),男,河南舞钢人,硕士研究生,主要研究方向:分布式系统、服务计算。
  • 基金资助:

    国家863计划项目(2009AA012417)

Grid service discovery algorithm based on attribute weight and rough set

ZHAO Xu,HUANG Yong-zhong,AN Liu-yang   

  1. Institute of Information Engineering, Information Engineering University, Zhengzhou Henan 450002, China
  • Received:2011-06-22 Revised:2011-08-29 Online:2012-02-06 Published:2012-01-01
  • Contact: ZHAO Xu

摘要: 针对网格服务发现中发现效率低的问题,基于本体技术及知识表示系统和决策表的理论,提出一种优化的考虑服务属性权重的服务发现算法。通过对服务调用历史记录的规则抽取和属性权重计算,给出了包含信息预处理、粗糙集服务匹配的两个阶段服务发现算法实现,并分别从查准率和查全率两个方面进行了理论分析和实验验证。结果表明,所提算法有较高的查全率和查准率;同时,候选服务的排序结果更符合用户的需求。

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

Abstract: 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.

Key words: grid service, rough set theory, attribute weight, service discovery algorithm

中图分类号: