A survey on distributed approaches to graph based reputation measures

ACM International Conference Proceeding Series

Volumn , Issue , 2007, Pages

  Avrachenkov, Konstantin ^a   Nemirovsky, Danil ^b,c   Pham, Kim Son ^c  

^a INRIA Sophia Antipolis ^*

^b INRIA   (France)

^c ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; DIRECTED GRAPHS; GRAPHIC METHODS; PEER TO PEER NETWORKS; SEARCH ENGINES;

AD-HOC NETWORKS; DISTRIBUTED APPROACHES; DOCUMENT RANKING; ELECTRONIC MARKET; GRAPH-BASED; P2P NETWORK; RANDOM WALK; RANKING SYSTEM; REPUTATION SYSTEMS; WEIGHTED GRAPH;

SURVEYS;

EID: 85134194335     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. K. Avrachenkov and N. Litvak. “Decomposition of the Google PageRank and Optimal Linking Strategy”. INRIA Research Report no. 5101, 2004.
2. K. Avrachenkov, N. Litvak, D. Nemirovsky and N. Osipova, “Monte Carlo methods in PageRank computation: When one iteration is sufficient”, SIAM Journal on Numerical Analysis, v.45, no.2, pp.890-904, 2007.
3. A. Berman and R.J. Plemmons. “Nonnegative Matrices in the Mathematical Sciences”. SIAM Classics In Applied Mathematics, SIAM, Philadelphia, 1994.
4. Biologically inspired Network and Services (BIONETS): http://www.bionets.org/
5. L.A. Breyer, “Markovian Page Ranking Distributions: Some Theory and Simulations”, Technical report, 2002; available online at http://www.lbreyer.com/preprints.html.
6. D. Chazan and W.L. Miranker, “Chaotic relaxation”, Linear Algebra and its Applications, v.2, pp.199-222, 1969.
7. P.A. Chirita, W. Nejdl, M. Schlosser, and O. Scurtu, “Personalized reputation management in P2P networks”, in Proceedings of the Trust, Security, and Reputation Workshop, 2004.
8. L. Eschenauer, V. Gligor and J. Baras, “On trust establishment in mobile Ad Hoc networks”, in Proceedings of Security Protocols Workshop, pp.47-66, 2002.
9. I. Foster and C. Kesselman, (eds.) “The GRID: Blueprint for a new computing infrastructure”, Elsevier, San Francisco, 2004.
10. C.F. Ipsen and S. Kirklad. “Convergence analysis of an improved PageRank algorithm”. NCSU CRSC Technical Report, 2004.
11. T.H. Haveliwala, “Topic-Sensitive PageRank”, in Proceedings of the 11th International World Wide Web Conference, 2002.
12. T.H. Haveliwala and S.D. Kamvar, “The Second Eigenvalue of the Google Matrix”, Stanford University Technical Report, March 2003.
13. D. de Jager, “PageRank: Three distributed algorithms”, Master thesis, Imperial College (University of London), 2004.
14. D. de Jager and J.T. Bradley, “Asynchronous iterative solution for state-based performance metrics”, in Proceedings of ACM SIGMETRICS 2007.
15. G. Jeh and J. Widom, “Scaling Personalized Web Search”, in Proceedings of the 12th International World Wide Web Conference, 2003.
16. A. Josang, R. Ismail and C. Boyd, “A survey of trust and reputation systems for online service provision”, Decision Support Systems, v.43, no.2, pp.618-644, 2007.
17. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. “Exploiting the block structure of the web for computing pagerank”. Stanford University Technical Report, 2003.
18. S.D. Kamvar, T.H. Haveliwala, C.D. Manning, and G.H. Golub, “Extrapolation methods for accelerating PageRank computations”, in Proceedings of the 12th International World Wide Web Conference, 2003.
19. S.D. Kamvar, M.T. Schlosser and H. Garcia-Molina, “The EigenTrust algorithm for reputation management in P2P networks”, in Proceedings of the 12th International World Wide Web Conference, 2003.
20. G. Kollias, E. Gallopoulos and D. Szyld, “Asynchronous iterative computations with Web information retrieval structures: The PageRank case”, in Proceedings of the International Conference ParCo 2005. Parallel Computing: Current & Future Issues of High-End Computing, pp.309-316.
21. A.N. Langville and C.D. Meyer. “Deeper inside pagerank”. Internet Mathematics, 1(3):335–380, 2005.
22. Ch.P.Ch. Lee, G.H. Golub, and S.A. Zenios, “A fast two-stage algorithms for computing PageRank”, SCCM Report, 2002.
23. I. Marek and I. Pultarova. “Two notes on local and global convergence analysis of iterative aggregation-disaggregation method” available on the Web, 2005.
24. C.D. Meyer and R.J. Plemmons. “Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems”. SIAM Rev., 1989.
25. C.B. Moler. “Numerical Computing with MATLAB”. SIAM, 2004.
26. L. Mui, M. Mohtashemi and A. Halberstadt, “A computational model of trust and reputation”, in Proccedings of the 35th Hawaii International Conference on System Sciences, 2002.
27. D.A. Nemirovsky. “Analysis of iterative method for PageRank computation based on decomposition of the Web graph” Master thesis, St.Petersburg State University, in Russian, 2005.
28. The Open Directory Project www.dmoz.org
29. L. Page, S. Brin, R. Motwani and T. Winograd, “The PageRank citation ranking: Bringing order to the Web”, Technical Report, Stanford Digital Library Technologies Project , 1998.
30. K. Sankaralingam, S. Sethumadhavan and J.C. Browne, “Distributed pagerank for P2P systems”, in Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing, 2003.
31. S.M. Shi, J. Yu, G.W. Yang and D.X. Wang, “Distributed page ranking in structured P2P networks”, in Proceeding of International Conference on Parallel Processing, 2003.
32. W.J. Stewart. “Introduction to the numerical solutions of Markov chains”. Princeton University Press, Princeton, 1994.
33. A. Yamamoto, D. Asahara, T. Itao, S. Tanaka and T. Suda, “Distributed pagerank: a distributed reputation model for open peer-to-peer network”, in Proceedings of the International Symposium on Applications and the Internet Workshops, 2004.
34. Y. Zhu and Sh. Ye and X. Li, “Distributed PageRank computation based on iterative aggregation-disaggregation methods”, in CIKM’05: Proceedings of the 14th ACM international conference on Information and knowledge management, 2005, an updated version is available at http://www.cs.cmu.edu/yangboz/cikm05 pagerank.pdf.
35. C.-N. Ziegler and G. Lausen, “Spreading activation models for trust propagation”, in Proceedings of IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004.
36. C.-N. Ziegler and G. Lausen, “Propagation models for trust and distrust in social networks”, Information Systems Frontiers, v.7, no.4/5, pp.337-358, 2005.