首页 | 本学科首页   官方微博 | 高级检索  
     检索      

面向误差最小化的在线服务信誉度量
引用本文:曾俊威,付晓东,岳昆,刘骊,刘利军,冯勇.面向误差最小化的在线服务信誉度量[J].重庆大学学报(自然科学版),2020,43(7):63-74.
作者姓名:曾俊威  付晓东  岳昆  刘骊  刘利军  冯勇
作者单位:昆明理工大学 信息工程与自动化学院, 昆明 650500;昆明理工大学 信息工程与自动化学院, 昆明 650500;昆明理工大学 云南省计算机技术应用重点实验室, 昆明 650500;云南大学 信息学院, 昆明 650091
基金项目:国家自然科学基金资助项目(61962030,U1802271,61862036,81560296,61662042);云南省基础研究计划杰出青年项目(2019FJ011);云南省中青年学术和技术带头人后备人才培养计划项目(201905C160046)。
摘    要:由于每个在线服务可以通过其自身的真实质量被客观比较,存在潜在的真相服务排序。为了使用户进行服务选择时有真实客观的在线服务信誉排序作为参考,服务信誉应当尽可能地接近真相服务排序。提出一种面向误差最小化的在线服务信誉度量方法。该方法将用户对服务的偏好排序视为对真实服务排序的带噪估计,利用Kendall tau距离指标来衡量服务排序与真相排序之间的误差,通过设定真相与用户对服务的偏好排序集合之间的平均误差上限找出可能的真相服务排序,寻找与可能的真相服务排序集合之间平均误差最小的服务排序作为服务信誉。由于所有的服务排序都有可能为真相排序,造成了该方法的计算困难,利用分支切割法对该方法进行优化求解。以真实数据集和模拟数据集为基础,通过实验验证了该方法在保证运行效率的同时得到与真相误差更小的信誉度量结果。

关 键 词:在线服务  信誉度量  真相排序  最小误差  分支切割法
收稿时间:2019/12/18 0:00:00

Online service reputation measurement for error minimization
ZENG Junwei,FU Xiaodong,YUE Kun,LIU Li,LIU Lijun,FENG Yong.Online service reputation measurement for error minimization[J].Journal of Chongqing University(Natural Science Edition),2020,43(7):63-74.
Authors:ZENG Junwei  FU Xiaodong  YUE Kun  LIU Li  LIU Lijun  FENG Yong
Institution:Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, P. R. China;Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, P. R. China;Yunnan Provincial Key Laboratory of Computer Technology Application, Kunming University of Science and Technology, Kunming 650500, P. R. China;School of Information Science and Engineering, Yunnan University, Kunming 650091, P. R. China
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 choosing services, service reputation should be as close as possible to the true service ranking. In this paper, an online service reputation measurement method for error minimization was proposed and it regarded user preference ranking as a noisy estimation of real service ranking. Firstly, Kendall tau distance was used to measure the error between service ranking and truth ranking. Then, the possible ranking of truth services was 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 minimum average error between itself and the possible sets of service ranking was found as the service reputation. Because all the service ranking could be the truth ranking, causing the computational difficulty of this method, the branch-and-cut algorithm was used to optimize the solution. Based on the real and simulated data sets, experiments were carried out and the result showed that reputation measurement results could be obtained with less error between it and the truth while ensuring the operation efficiency.
Keywords:online services  reputation measurement  true ranking  minimum error  branch-and-cut algorithm
本文献已被 CNKI 等数据库收录!
点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号