A Service Ranking Method based on Rough Set Theory

被引:0
|
作者
Li, Fei [1 ]
Hu, Wensheng [1 ]
机构
[1] Wuhan Univ, Sch Comp, Wuhan, Peoples R China
关键词
rough set; service ranking; quality of service; WEB SERVICES;
D O I
暂无
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
The problem of QoS-based Web service selection in the complex network environment has important application value. This paper proposes a service ranking algorithm based on rough set similarity and weight. Transforming the service selection into multi-attribute decision model, preprocessing QoS data through reinforce calculation and discrete calculation, then the ordering queue can be get by our service selection algorithm. Finally, an example is given to demonstrate the feasibility and effectivity of the algorithm.
引用
收藏
页码:213 / 216
页数:4
相关论文
共 9 条
  • [1] [Anonymous], 2004, COMPUTER SCI, V31, P85
  • [2] Cheng Y.-W., 2007, THESIS
  • [3] Dai JH, 2006, LECT NOTES ARTIF INT, V4062, P200
  • [4] He Ya-Qun, 2004, Journal of Systems Engineering, V19, P117
  • [5] Jiang CM, 2006, THESIS
  • [6] LiuWei, 2007, J JILIN NORMAL U NAT
  • [7] Tian M., 2005, QOS INTEGRATION WEB
  • [8] QoS-based Web services selection
    Wang, Hongbing
    Tong, Ping
    Thompson, Phil
    Li, Yinsheng
    [J]. ICEBE 2007: IEEE INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING, PROCEEDINGS, 2007, : 631 - +
  • [9] Deploying and managing Web services: issues, solutions, and directions
    Yu, Qi
    Liu, Xumin
    Bouguettaya, Athman
    Medjahed, Brahim
    [J]. VLDB JOURNAL, 2008, 17 (03): : 537 - 572