Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Proceedings of the 11th international conference on World Wide Web
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Propagation of trust and distrust
Proceedings of the 13th international conference on World Wide Web
Trust-based recommendation systems: an axiomatic approach
Proceedings of the 17th international conference on World Wide Web
The slashdot zoo: mining a social network with negative edges
Proceedings of the 18th international conference on World wide web
Dirichlet pagerank and trust-based ranking algorithms
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Leveraging trust and distrust for sybil-tolerant voting in online social media
Proceedings of the 1st Workshop on Privacy and Security in Online Social Media
Proceedings of the sixth ACM international conference on Web search and data mining
Hi-index | 0.00 |
Trust propagation is a fundamental topic of study in the theory and practice of ranking and recommendation systems on networks. The Page Rank [9] algorithm ranks web pages by propagating trust throughout a network, and similar algorithms have been designed for recommendation systems. How might one analogously propagate distrust as well? This is a question of practical importance and mathematical intrigue (see, e.g., [2]). However, it has proven challenging to model distrust propagation in a manner which is both logically consistent and psychologically plausible. We propose a novel and simple extension of the Page Rank equations, and argue that it naturally captures most types of distrust that are expressed in such networks. We give an efficient algorithm for implementing the system and prove desirable properties of the system.