A NodeRank Algorithm for Computing Reputation Sample Clauses

A NodeRank Algorithm for Computing Reputation. ‌ The basic goal of Pujol et al. [228] is to use a ranking algorithm to establish the reputation of nodes in a social network. The idea is that properties about a person’s degree of expertise (or his reputation) may be inferred from how well this person is connected in his social network. LiquidPub/2009/D1.1/v2.0 October 5, 2009 67 Pujol et al. [228] build their social networks using information from personal web pages, reports or documents authorship, participation in a project, hierarchical structure in the community or organization, sharing of physical resources, sharing of virtual resources (e.g. news groups, forums, etc.), and email traffic. A NodeRanking algorithm is proposed for creating a ranking of reputation ratings. The idea is that the ranking of a node would rely on its ‘degree of authority’, or what may be seen as the degree of ‘importance’ of the node. “Authority of a node a is calculated as a function of the total measure of authority present in the network and the authority of the nodes pointing to node a.” Note that this method requires no user feedback and is similar to Pagerank. However, while Pagerank uses global information of the network graph, NodeRank uses only local information.