paper-with-me

Papers

Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering

2018-06-20 · Avrachenkov Konstantin, Kadavankandy Arun, Litvak Nelly

We analyse a mean-field model of Personalized PageRank on the Erdos-Renyi random graph containing a denser planted Erdos-Renyi subgraph. We investigate the regimes where the values of Personalized PageRank concentrate around the mean-field value. We also study the optimization of the damping factor, the only parameter in Personalized PageRank. Our theoretical results help to understand the applicability of Personalized PageRank and its limitations for local graph clustering.

📄 PDF Abstract BibTeX arXiv:1806.07640

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringGraph Clustering

Similar Papers 제목 키워드 기반

Fast Incremental and Personalized PageRank

2010-06-15 · Bahman Bahmani, Abdur Chowdhury, Ashish Goel

In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus on SALSA), on large-scale dynamically evol…

Effective Resistance-based Germination of Seed Sets for Community Detection

2018-10-31 · Eskreis-Winkler Jonathan, Kondor Risi

Community detection is, at its core, an attempt to attach an interpretable function to an otherwise indecipherable form. The importance of labeling communities has obvious implications for identifying clusters in social …

Community Detection

Varying Vector Representations and Integrating Meaning Shifts into a PageRank Model for Automatic Term Extraction

2020-05-01 · LREC 2020 5 · Anurag Nigam, Anna H{\"a}tty, Sabine Schulte im Walde

We perform a comparative study for automatic term extraction from domain-specific language using a PageRank model with different edge-weighting methods. We vary vector space representations within the PageRank graph algo…

Term Extraction

Efficient Algorithms for Personalized PageRank

2015-12-15 · Lofgren Peter

We present new, more efficient algorithms for estimating random walk scores such as Personalized PageRank from a given source node to one or several target nodes. These scores are useful for personalized search and recom…

Personalized PageRank Estimation and Search: A Bidirectional Approach

2015-07-21 · Peter Lofgren, Siddhartha Banerjee, Ashish Goel

We present new algorithms for Personalized PageRank estimation and Personalized PageRank search. First, for the problem of estimating Personalized PageRank (PPR) from a source distribution to a target node, we present a …