Online Service Reputation Measurement Method Based on Kendall tau Distance

被引：0
|
作者：
Zheng S. [1 ]
Fu X. [1 ,2 ]
Yue K. [3 ]
Liu L. [1 ]
Liu L. [1 ]
Feng Y. [1 ]
机构：
[1] Yunnan Provincial Key Laboratory of Computer Technology Application, Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming
[2] Faculty of Aeronautics, Kunming University of Science and Technology, Kunming
[3] School of Information Science and Engineering, Yunnan University, Kunming
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2019年 / 56卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Kendall tau distance; Online service; Preference; Reputation measurement; Simulated annealing;
D O I：
10.7544/issn1000-1239.2019.20180034
中图分类号：
学科分类号：
摘要：
Due to the inconsistent user preferences and the inconsistent rating criteria, the ratings given by different users to one service are actually incomparable, and the reputation mechanism based on assumption of the consistent rating criteria cannot guarantee the comparability among different service reputations, which will result in unobjective outcome when the reputations are used to choose services. To improve the objectivity of online services reputation measurement under the circumstance referred above, this paper presents a method of online service reputation measurement based on Kendall tau distance. Firstly, a distance metric is defined to measure the consistency between the two rating vectors. Secondly, the measurement of online service reputation is modeled as an optimization problem to find a reputation vector that minimizes the Kendall tau distance between the reputation vector and the user-service rating matrix. Finally, simulated annealing algorithm is used to solve the optimization problem and the reputation vector is served as a service reputation. The rationality and effectiveness of the method have been verified by experimental study. The experiments show that the method can meet the preferences of most users, so that users can make right services choice decision, and ensure the efficiency while improving the manipulation resistance ability of the reputation measurement method. © 2019, Science Press. All right reserved.
引用
收藏
页码：884 / 894
页数：10
相关论文
共 27 条
  • [1] Josang A., Ismail R., Boyd C., A survey of trust and reputation systems for online service provision, Decision Support Systems, 43, 2, pp. 618-644, (2007)
  • [2] Song G., Yang D., On some problems in the design of online reputation management system in electronic commerce, Systems Engineering, 22, 9, pp. 5-9, (2004)
  • [3] Mao C., Singh J.P., Computing and using reputations for Internet ratings, Proc of the 3rd ACM Conf on Electronic Commerce, pp. 154-162, (2001)
  • [4] Dellarocas C., Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior, Proc of the 2nd ACM Conf on Electronic Commerce, pp. 150-157, (2000)
  • [5] He L., Huang H., Zhang W., A survey of trust and reputation systems in multi-agent systems, Journal of Computer Research and Development, 45, 7, pp. 1151-1160, (2008)
  • [6] Josang A., Guo G., Pini M.S., Et al., Combining recommender and reputation systems to produce better online advice, Proc of the 10th Int Conf on Modeling Decisions for Artificial Intelligence, pp. 126-138, (2013)
  • [7] Allahbakhsh M., Ignjatovic A., Motahari-Nezhad H.R., Et al., Robust evaluation of products and reviewers in social rating systems, World Wide Web, 18, 1, pp. 73-109, (2015)
  • [8] Li J., Wang X., Liu R., User reputation-based participatory incentive mechanism in social and community intelligence systems, Journal of Frontiers of Computer Science and Technology, 9, 12, pp. 1471-1482, (2015)
  • [9] Betzler N., Fellows M.R., Guo J., Et al., Fixed-parameter algorithms for Kemeny rankings, Theoretical Computer Science, 410, 45, pp. 4554-4570, (2009)
  • [10] Yuan Y., Ruohomaas S., Feng X., Addressing common vulnerabilities of reputation systems for electronic commerce, Journal of Theoretical and Applied Electronic Commerce Research, 7, 1, pp. 1-20, (2012)
123