With the rapid growth of the Web, users get easily lost in the rich hyper structure. Providing relevant information to the users to cater to their needs is the primary goal of website owners. Therefore, finding the content of the Web and retrieving the users’ interests and needs from their behavior have become increasingly important. Web mining is used to categorize users and pages by analyzing...

This work studies a fully distributed algorithm for computing the PageRank vector, which is inspired by the Matching Pursuit and features: 1) fully distributed 2) expected converges with exponential rate 3) low storage requirement (two scalar values per page). Illustrative experiments are conducted to verify the findings. I. PROBLEM STATEMENT PageRank vector was proposed by the founders of the ...

Mobile devices provide an interesting context for map drawing. This paper presents a novel road-selection algorithm based on PageRank, the algorithm famously used by Google to rank web pages by importance. Underlying the PageRank calculation is a probabilistic model of user behavior. We provide suitable generalizations of this model to road networks. Our implementation of the proposed algorithm...

The sybil attack is one of the easiest and most common methods of manipulating reputation systems. In this paper, we quantify the increase in reputation due to creating sybils under the PageRank algorithm. We compute explicit bounds for the possible PageRank value increase, and we use these bounds to estimate the rank increase. Finally, we measure the effect of sybil creation on nodes in a web ...

Motivated by numerous models of representing trust and distrust within a graph ranking system, we examine a quantitative vertex ranking with consideration of the influence of a subset of nodes. An efficient algorithm is given for computing Dirichlet PageRank vectors subject to Dirichlet boundary conditions on a subset of nodes. We then give several algorithms for various trust-based ranking pro...

There are many methods to rank football players based on their performance in a game or series of games. However, since most subjective, this paper proposes the PageRank algorithm as an objective method team, where can be considered nodes, and passes made between them edges graph. To achieve this, we consider weighting functions, which parameters number quality well actions individual game. In ...

Graph ranking algorithms such as PageRank and HITS share the common idea of calculating eigenvectors of graph adjacency matrices. This paper shows that the power method usually used to calculate eigenvectors is also present in a spreading activation search. In addition, we empirically show that spreading activation algorithm is able to converge on periodic graphs, where power method fails. Furt...