面向误差最小化的在线服务信誉度量
DOI:
作者:
作者单位:

1.昆明理工大学;2.云南大学

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金项目(61962030,U1802271,61862036,81560296,61662042)、云南省基础研究计划杰出青年项目(2019FJ011)、云南省中青年学术和技术带头人后备人才培养计划项目 (201905C160046)


Online Service Reputation Measurement for Error Minimization
Author:
Affiliation:

1.Kunming University of Science and Technology;2.Yunnan University

Fund Project:

National Natural Science Foundation of China (61962030, U1802271, 61862036, 81560296, 61662042)、Science Foundation for Distinguished Young Scholars of Yunnan Province (2019FJ011)、Yunnan Provincial Foundation for Leaders of Disciplines in Science and Technology (201905C160046)

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

    由于每个在线服务可以通过其自身的真实质量被客观比较,因此存在潜在的真相服务排序。为了使用户进行服务选择时有真实客观的在线服务信誉排序作为参考,服务信誉应当尽可能地接近真相服务排序。因此提出一种面向误差最小化的在线服务信誉度量方法。该方法将用户对服务的偏好排序视为对真实服务排序的带噪估计,首先利用Kendall tau距离指标来衡量服务排序与真相排序之间的误差。然后通过设定真相与用户对服务的偏好排序集合之间的平均误差上限找出可能的真相服务排序。最后寻找与可能的真相服务排序集合之间平均误差最小的服务排序作为服务信誉。由于所有的服务排序都有可能为真相排序,造成了该方法的计算困难问题,利用分支切割法对该方法进行优化求解。以真实数据集和模拟数据集为基础,通过实验验证了该方法可在保证运行效率的同时得到与真相误差更小的信誉度量结果。

    Abstract:

    Since each online service can be objectively compared by its own real quality, there is a potential truth ranking of services. In order to provide users with the most authentic and objective online service reputation ranking, as a reference for users when choosing services. service reputation should be as close as possible to the true service ranking. Therefore, an online service reputation measurement method for error minimization is proposed. This method regards user preference ranking as a noisy estimation of real service ranking. Firstly, Kendall tau distance is used to measure the error between service ranking and truth ranking. Then, the possible ranking of truth services is found by setting the upper limit of the average error between the truth and the user's preference ranking set. Finally, the service ranking with the lowest average error between the possible set of service ranking and the possible set of service ranking is found as the service reputation. Because all the service ranking may be the truth ranking, the computational difficulty of this method is caused. The Branch-and-Cut algorithm is used to optimize the solution. Based on the real and simulated data sets, experiments show that this method can obtain the credibility measurement results with less error with the truth while ensuring the operation efficiency.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2019-11-26
  • 最后修改日期:2019-12-17
  • 录用日期:2019-12-18
  • 在线发布日期:
  • 出版日期: