DagSemProc.07071.13.pdf
- Filesize: 0.62 MB
- 17 pages
Document
Multidamping simulation framework for link-based ranking
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 7071
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2007-06-28
Cite AsGet BibTex
Giorgios Kollias and Efstratios Gallopoulos. Multidamping simulation framework for link-based ranking. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.07071.13
https://doi.org/10.4230/DagSemProc.07071.13
Abstract
We review methods for the
approximate computation of PageRank. Standard methods are based on
the eigenvector and linear system characterizations. Our starting
point are recent methods based on series representation whose
coefficients are damping functions, for example Linear Rank,
HyperRank and TotalRank, etc. We propose a multidamping framework
for interpreting PageRank and these methods. Multidamping is based
on some new useful properties of Google type matrices. The approach can
be generalized and could help in the exploration of new
approximations for list-based ranking. This is joint work with Georgios Kollias and is supported by a Pythagoras-EPEAEK-II grant.
Keywords
- PageRank
- power method
- eigenvalues
- teleportation
- list-based ranking
- TotalRank
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads