作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (06): 170-172.

• 网络与通信 • 上一篇    下一篇

粗糙集理论在Overlay网络服务发现中的应用

倪景秀1,2,余镇危1,贾民政1,李 宁1,班成英1   

  1. (1. 中国矿业大学(北京)机电与信息工程学院,北京 100083;2. 北京联合大学,北京 100101)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-03-20 发布日期:2007-03-20

Study of Overlay Web Service Discovery Based on Rough Set

NI Jingxiu1,2, YU Zhenwei1, JIA Minzheng1, LI Ning1, BAN Chengying1   

  1. (1. College of Mechanical, Electronic & Information Engineering, China University of Mining and Technology, Beijing 100083; 2. Beijing Union University, Beijing 100101)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-03-20 Published:2007-03-20

摘要: 提出了基于粗糙集理论的overlay网络服务发现机制。该机制利用粗糙集理论中属性集约简算法以及决策规则集优化算法,有效处理了overlay网络体系中普遍存在的不完备信息。结果表明,通过决策规则优化能够实现用户需求和网络服务之间的模糊匹配,从而克服了传统精确匹配的查全率低、查准率差的缺点,扩展了粗糙集的应用领域。

关键词: 粗糙集, 不完备信息, 决策规则, Overlay网络, 服务发现

Abstract: This paper presents a model of overlay network service discovery. This model deals effectively with the familiar imperfect information lying in overlay network architecture, with the help of attribute reduction algorithm and decision rule optimization algorithm in rough sets theory. Results from experiment indicate that decision rule optimization algorithm can realize the rough matching of user demand and service attribute, therefore avoiding the low efficiency of traditional exact matching in exactness and maturity, so this model broadens the application field of rough sets.

Key words: Rough set, Imperfect information, Decision rules, Overlay networks, Service discovery

中图分类号: