当前位置: X-MOL 学术ACM Trans. Knowl. Discov. Data › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Robust Reputation-Based Group Ranking System and Its Resistance to Bribery
ACM Transactions on Knowledge Discovery from Data ( IF 4.0 ) Pub Date : 2021-07-21 , DOI: 10.1145/3462210
João Saúde 1 , Guilherme Ramos 2 , Ludovico Boratto 3 , Carlos Caleiro 4
Affiliation  

The spread of online reviews and opinions and its growing influence on people’s behavior and decisions boosted the interest to extract meaningful information from this data deluge. Hence, crowdsourced ratings of products and services gained a critical role in business and governments. Current state-of-the-art solutions rank the items with an average of the ratings expressed for an item, with a consequent lack of personalization for the users, and the exposure to attacks and spamming/spurious users. Using these ratings to group users with similar preferences might be useful to present users with items that reflect their preferences and overcome those vulnerabilities. In this article, we propose a new reputation-based ranking system, utilizing multipartite rating subnetworks, which clusters users by their similarities using three measures, two of them based on Kolmogorov complexity. We also study its resistance to bribery and how to design optimal bribing strategies. Our system is novel in that it reflects the diversity of preferences by (possibly) assigning distinct rankings to the same item, for different groups of users. We prove the convergence and efficiency of the system. By testing it on synthetic and real data, we see that it copes better with spamming/spurious users, being more robust to attacks than state-of-the-art approaches. Also, by clustering users, the effect of bribery in the proposed multipartite ranking system is dimmed, comparing to the bipartite case.

中文翻译:

稳健的基于声誉的群体排名系统及其对贿赂的抵抗

在线评论和意见的传播及其对人们行为和决策的影响越来越大,激发了从海量数据中提取有意义信息的兴趣。因此,产品和服务的众包评级在企业和政府中发挥了关键作用。当前最先进的解决方案使用对项目表示的平均评分对项目进行排名,因此缺乏对用户的个性化,以及遭受攻击和垃圾邮件/虚假用户的风险。使用这些评级对具有相似偏好的用户进行分组可能有助于向用户展示反映他们偏好的项目并克服这些漏洞。在本文中,我们提出了一种新的基于声誉的排名系统,利用多方评级子网络,使用三个度量根据用户的相似性对用户进行聚类,其中两个基于 Kolmogorov 复杂性。我们还研究了它对贿赂的抵抗力以及如何设计最佳的贿赂策略。我们的系统是新颖的,因为它通过(可能)为不同的用户组为同一项目分配不同的排名来反映偏好的多样性。我们证明了系统的收敛性和效率。通过在合成数据和真实数据上对其进行测试,我们发现它可以更好地应对垃圾邮件/虚假用户,比最先进的方法更能抵御攻击。此外,通过对用户进行聚类,与二分情况相比,所提议的多方排名系统中的贿赂效果变暗了。我们的系统是新颖的,因为它通过(可能)为不同的用户组为同一项目分配不同的排名来反映偏好的多样性。我们证明了系统的收敛性和效率。通过在合成数据和真实数据上对其进行测试,我们发现它可以更好地应对垃圾邮件/虚假用户,比最先进的方法更能抵御攻击。此外,通过对用户进行聚类,与二分情况相比,所提议的多方排名系统中的贿赂效果变暗了。我们的系统是新颖的,因为它通过(可能)为不同的用户组为同一项目分配不同的排名来反映偏好的多样性。我们证明了系统的收敛性和效率。通过在合成数据和真实数据上对其进行测试,我们发现它可以更好地应对垃圾邮件/虚假用户,比最先进的方法更能抵御攻击。此外,通过对用户进行聚类,与二分情况相比,所提议的多方排名系统中的贿赂效果变暗了。
更新日期:2021-07-21
down
wechat
bug