A survey on distributed approaches to graph based reputation measures

8Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Reputation systems are indispensable for the operation of Internet mediated services, electronic markets, document ranking systems, P2P networks and Ad Hoc networks. Here we survey available distributed approaches to the graph based reputation measures. Graph based reputation measures can be viewed as random walks on directed weighted graphs whose edges represent interactions among peers. We classify the distributed approaches to graph based reputation measures into three categories. The first category is based on asynchronous methods. The second category is based on the aggregation/decomposition methods. And the third category is based on the personalization methods which use the information available locally.

Cite

CITATION STYLE

APA

Avrachenkov, K., Nemirovsky, D., & Pham, K. S. (2007). A survey on distributed approaches to graph based reputation measures. In ACM International Conference Proceeding Series. Association for Computing Machinery. https://doi.org/10.4108/smctools.2007.2027

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free