Approximating Personalized PageRank with Minimal Use of Web Graph Data

DOI10.1080/15427951.2006.10129128MaRDI QIDQ5384922zbMATH OpenOpenAlexFDO

Authors David F. Gleich, Marzia Polito

Publication date 29 April 2008

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2006.10129128

zbMATH Keywords

PageRank scorewebpage

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• Algorithms and Models for the Web-Graph
• A Survey on PageRank Computing
• Quick detection of top-k personalized PageRank lists
• Cluster Based Personalized Search

Cited in

(10)

• Personalized PageRank clustering: a graph clustering algorithm based on random walks
• PageRank beyond the web
• Quick detection of top-k personalized PageRank lists
• Bookmark-Coloring Algorithm for Personalized PageRank Computing
• Cluster Based Personalized Search
• Algorithms and Models for the Web-Graph
• Criteria for cluster-based personalized search
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• Sublinear Algorithms for Local Graph-Centrality Estimation
• Randomly sparsified Richardson iteration: a dimension-independent sparse linear solver

This page was built for publication: Approximating Personalized PageRank with Minimal Use of Web Graph Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384922)