用户群体满意度最大化的Top-k在线服务评价
作者:
作者单位:

作者简介:

赵时海(1993-),女,博士生,CCF学生会员,主要研究领域为服务计算.
刘骊(1979-),女,博士,教授,CCF高级会员,主要研究领域为服务计算,智能家居.
付晓东(1975-),男,博士,教授,博士生导师,CCF高级会员,主要研究领域为服务计算,智能决策.
冯勇(1975-),男,博士,教授,CCF专业会员,主要研究领域为物联网服务.
岳昆(1979-),男,博士,教授,博士生导师,CCF高级会员,主要研究领域为人工智能,服务计算.
刘利军(1978-),男,副教授,CCF专业会员,主要研究领域为服务计算,移动医疗.

通讯作者:

付晓东,E-mail:xiaodong_fu@hotmail.com

基金项目:

国家自然科学基金(61962030,61862036,61860318);NSFC-云南联合基金(U1802271);云南省基础研究计划(2019FJ011);云南省中青年学术和技术带头人后备人才培养计划(202005AC160036)


Top-k Online Service Evaluating to Maximize Satisfaction of User Group
Author:
Affiliation:

Fund Project:

National Natural Science Foundation of China (61962030, 61862036, 61860318); Joint Fund of NSFC-Yunnan (U1802271); Basic Research Program of Yunnan Province (2019FJ011); Young and Mid-aged Academic and Technical Talent Reserve Training Program of Yunnan Province (202005AC160036)

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
    摘要:

    考虑用户评价准则不一致的在线服务评价通常以服务的完整排序作为评价结果,而不是选择出使用户群体满意度最大的Top-k在线服务集合,使评价结果难以满足Top-k在线服务评价场景的合理性和公平性需求.为此,提出了一种用户群体满意度最大化的Top-k在线服务评价方法.该方法首先定义用户群体满意度指标,以衡量选择的k个在线服务的合理性;其次,考虑用户评价准则不一致及用户偏好信息不完整的情况,采用Borda规则将用户对在线服务的偏好关系构造为用户-服务满意度矩阵;然后借鉴Monroe比例代表思想,将Top-k在线服务评价问题建模为寻找最大化用户群体满意度的在线服务集合的优化问题;最后采用贪心算法对该优化问题进行求解,将得到的在线服务集合作为Top-k评价结果.通过理论分析和实验验证了该方法的合理性和有效性.理论分析表明,该方法满足Top-k在线服务评价所需的比例代表性和公平性.同时,实验结果也表明,该方法能够在合理的时间内获得接近用户群体满意度理想上界的评价结果,可以有效地辅助用户群体做出正确的服务选择决策.另外,该方法还可以在用户偏好不完整的情况下实现Top-k在线服务评价.

    Abstract:

    Online service evaluations that consider inconsistent user evaluation criteria usually use a complete ranking of services as the evaluation result, instead of selecting the Top-k online service set that maximizes the satisfaction of the user group. Thus, it makes the evaluation results cannot satisfy the rationality and fairness requirement in the scenario of Top-k online service evaluation. This study proposes a Top-k online service evaluation method that maximizes the satisfaction of user group. Firstly, a metric of user group satisfaction is defined to measure the rationality of the selected k online services. Secondly, considering the inconsistency of user evaluation criteria and incomplete user preference information, the Borda rule is used to construct user-service matrix based on users' preference relationship for online services. Then, inspired by the theory of Monroe proportional representation, the Top-k online service evaluation problem is modeled as an optimization problem to find a set of online services that maximizes satisfaction of the user group. Finally, a greedy algorithm is designed to solve the optimization problem and the obtained set of online services is served as the result of Top-k services evaluation. The rationality and effectiveness of the method are verified by theoretical analysis and experiments study. Theoretical analysis shows that the proposed method satisfies the proportional representation and fairness required for Top-k online service evaluation. Meanwhile, experiments also show that the method can obtain the result close to the ideal upper bound of the user group satisfaction in the reasonable time, so that the user group can make right service choice decision. In addition, the method can also realize Top-k online service evaluation when users' preferences are incomplete.

    参考文献
    相似文献
    引证文献
引用本文

赵时海,付晓东,岳昆,刘骊,冯勇,刘利军.用户群体满意度最大化的Top-k在线服务评价.软件学报,2021,32(11):3388-3403

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
历史
  • 收稿日期:2019-11-18
  • 最后修改日期:2020-02-07
  • 录用日期:
  • 在线发布日期: 2021-11-05
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号