Peer-to-Peer Rating

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Danny Bickson Articles by Dahlia Malkhi Articles by Lidong Zhou

Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)

Peer-to-Peer Rating

Galway, Ireland

September 02-September 05

ISBN: 0-7695-2986-0

	ASCII Text	x
	Danny Bickson, Dahlia Malkhi, Lidong Zhou, "Peer-to-Peer Rating," Peer-to-Peer Computing, IEEE International Conference on, pp. 211-218, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007.

	BibTex	x
	@article{ 10.1109/P2P.2007.36, author = {Danny Bickson and Dahlia Malkhi and Lidong Zhou}, title = {Peer-to-Peer Rating}, journal ={Peer-to-Peer Computing, IEEE International Conference on}, volume = {0}, year = {2007}, isbn = {0-7695-2986-0}, pages = {211-218}, doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2007.36}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Peer-to-Peer Computing, IEEE International Conference on TI - Peer-to-Peer Rating SN - 0-7695-2986-0 SP211 EP218 A1 - Danny Bickson, A1 - Dahlia Malkhi, A1 - Lidong Zhou, PY - 2007 KW - null VL - 0 JA - Peer-to-Peer Computing, IEEE International Conference on ER -

Danny Bickson, Hebrew University of Jerusalem

Dahlia Malkhi, Microsoft Research, Silicon Valley

Lidong Zhou, Microsoft Research, Silicon Valley

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2007.36

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.

Citation:

Danny Bickson, Dahlia Malkhi, Lidong Zhou, "Peer-to-Peer Rating," p2p, pp.211-218, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.