Peer-to-peer rating

Proceedings - P2P - 7th IEEE International Conference on Peer-to-Peer Computing

Volumn , Issue , 2007, Pages 211-218

  Bickson, Danny ^a   Malkhi, Dahlia ^b   Zhou, Lidong ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ITEMS; EFFICIENT COMPUTATION; INFORMATION CENTRALITY; INTERNATIONAL CONFERENCES; LARGE-SCALE SIMULATIONS; PAGE RANKS; PEER-TO-PEER; PEER-TO-PEER COMPUTING; PROBABILISTIC GRAPHICAL MODELS; RANKING METHODS; SOCIAL INFLUENCES; SOCIAL NETWORKS; SUB GRAPHS;

GRAPHIC METHODS;

ELECTRONICS ENGINEERING;

EID: 48049105756     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2007.4343482     Document Type: Conference Paper

References (21)

1. C. C. Moallemi and B. Van Roy, "Consensus Propagation," IEEE Transactions on Information Theory, Vol. 52, No. 11, pp. 4753-4766, 2006.
2. Jason Johnson, Dmitry Malioutov, Alan Willsky, Walk-Sum Interpretation and Analysis of Gaussian Belief Propagation, In NIPS 05'.
3. J.R. Shewchuk. An Introduction to the Conjugate Gradient Method Without the Agonizing Pain. Technical Report CMU-CS-94-125, School of Computer Science, Carnegie Mellon University, 1994.
4. Grinstead and Snell's Introduction to Probability. The CHANCE Project. Chapter 11 - Markov chains. http://www.dartmouth.edu/chance/teaching_aids/ books_articles/probabillty_book/pdf.html
5. S. Brin and L. Page (1998). "The anatomy of a large-scale hypertextual Web search engine". Proceedings of the seventh international conference on World Wide Web 7, 107-117.
6. Y. Weiss and W. T. Freeman. Correctness of belief propagation in Gaussian graphical models of arbitrary topology. In NIPS-12, 1999
7. Dmitry M. Malioutov, Jason K. Johnson, Alan S. Willsky. Walk-Sums and Belief Propagation in Gaussian Graphical Models. In JMLR 7(Oct):2031-2064, 2006.
8. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The EigenTrust Algorithm for Reputation Management in P2P Networks. In Proceedings of the Twelfth International World Wide Web Conference, 2003.
9. Jon M. Kleinberg, Authoritative sources in a hyper-linked environment, Journal of the ACM (JACM), v.46 n.5, p.604-632, Sept. 1999
10. G. Elidan and I. McGraw and D. Koller, Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing, Proceedings of the Twenty-second Conference on Uncertainty in AI (UAI), Boston, Massachussetts, 2006
11. K. Crammer and Y. Singer. Pranking with ranking. In Proceedings of the conference on Neural Information Processing Systems (NIPS), 2001.
12. Amnon Shashua and Anat Levin. Ranking with large margin principle: Two approaches. In NIPS* 14, 2003
13. Jun Wang, Johan Pouwelse, Reginald Lagendijk and Marcel R. J. Reinders. Distributed Collaborative Filtering for Peer-to-Peer File Sharing Systems (2006), Proceedings of the 21st Annual ACM Symposium on Applied Computing(SAC06)
14. Han Peng, Xie Bo, Yang Fan and Sheng Ruimin. A scalable P2P recommender system based on distributed collaborative flltering.Expert Systems with Applications, Vol. 27, No. 2. (August 2004), pp. 203-210.
15. David Kempe, Jon Kleinberg, and Eva Tardos. Maximizing the spread of influence through a social network. In Proceedings of the Ninth International Conference on Knowledge Discovery and Data Mining, 2003.
16. Yehuda Koren, Stephen C. North, Chris Volinsky: Measuring and extracting proximity in networks. In KDD 2006. p. 245-255
17. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, and Mark Tuttle. Improved recommendation systems. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1174-1183, January 2005.
18. P. G. Doyle and J. L. Snell. Random Walks and Electrical Networks. The Mathematical Association of America, 1984. http://arxiv.org/abs/math.PR/0001057.
19. Ulrik Brandes and Daniel Fleisch. Centrality Measures Based on Current Flow. STACS 2005, LNCS 3404, pp. 533544, 2005.
20. Andras A. Benczr, Kroly Csalogny and Tams Saris. On the feasibility of low-rank approximation for personalized PageRank. In: The 14th Int'l World Wide Web Conference (WWW2005, poster), 2005.
21. http://research.microsoft.com/research/sv/Nocturnal/default.aspx