Traps and Pitfalls of Topic-Biased PageRank
From MaRDI portal
Publication:3520034
DOI10.1007/978-3-540-78808-9_10zbMath1142.68309OpenAlexW2306700499MaRDI QIDQ3520034
Paolo Boldi, Massimo Santini, Roberto Posenato, Sebastiano Vigna
Publication date: 19 August 2008
Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78808-9_10
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (5)
Multilinear PageRank ⋮ Axiomatic characterization of PageRank ⋮ On new PageRank computation methods using quantum computing ⋮ PageRank Beyond the Web ⋮ A Dynamical System for PageRank with Time-Dependent Teleportation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph fibrations, graph isomorphism, and PageRank
- A formula for singular perturbations of Markov chains
- Algorithms and Models for the Web-Graph
- Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
- Paradoxical Effects in PageRank Incremental Computations
This page was built for publication: Traps and Pitfalls of Topic-Biased PageRank