The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th 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
Page-reRank: Using Trusted Links to Re-Rank Authority
WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
Controversial users demand local trust metrics: an experimental study on Epinions.com community
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Predicting positive and negative links in online social networks
Proceedings of the 19th international conference on World wide web
| Hi-index | 0.00 |
Networks have attracted a great deal of attention the last decade, and play an important role in various scientific disciplines. Ranking nodes in such networks, based on for example PageRank or eigenvector centrality, remains a hot topic. Not only does this have applications in ranking web pages, it also allows peer-to-peer systems to have effective notions of trust and reputation and enables analyses of various (social) networks. Negative links however, confer distrust or dislike as opposed to positive links, and are usually not taken into account. In this paper we propose a ranking method we call exponential ranking, which allows for negative links in the network. We show convergence of the method, and demonstrate that it takes into account negative links effectively.