Peer-to-Peer Rating

Authors:
Danny Bickson;Dahlia Malkhi;Lidong Zhou
Affiliations:
Hebrew University of Jerusalem;Microsoft Research, Silicon Valley;Microsoft Research, Silicon Valley
Venue:
P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
Year:
2007

Citing 0
Cited 3

Poisonedwater: An improved approach for accurate reputation ranking in P2P networks

Future Generation Computer Systems
Overlay management for fully distributed user-based collaborative filtering

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Multi-evidence lifted message passing, with application to PageRank and the Kalman filter

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes to utilize algorithms from the probabilistic graphical models domain for Peer-to-Peer rating of data items and for computing "social influence" of nodes in a Peer-to-peer social network. We evaluate the practicality of our approach using largescale simulations over a MSN Live Messenger subgraph consisting of about a million nodes. Our algorithms are general since they can be used for Peer-to-peer monitoring and for the efficient computation of other node ranking methods, such as PageRank and Information Centrality.