Abstract
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 problems using Dirichlet PageRank with boundary conditions, showing several applications of our algorithms. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Chung, F., Tsiatas, A., & Xu, W. (2011). Dirichlet PageRank and trust-based ranking algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6732 LNCS, pp. 103–114). https://doi.org/10.1007/978-3-642-21286-4_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
