Overlapping Community Detection in Networks via Sparse Spectral Decomposition

Sankhya A(2021)

引用 1|浏览7
暂无评分
摘要
We consider the problem of estimating overlapping community memberships in a network, where each node can belong to multiple communities. More than a few communities per node are difficult to both estimate and interpret, so we focus on sparse node membership vectors. Our algorithm is based on sparse principal subspace estimation with iterative thresholding. The method is computationally efficient, with computational cost equivalent to estimating the leading eigenvectors of the adjacency matrix, and does not require an additional clustering step, unlike spectral clustering methods. We show that a fixed point of the algorithm corresponds to correct node memberships under a version of the stochastic block model. The methods are evaluated empirically on simulated and real-world networks, showing good statistical performance and computational efficiency.
更多
查看译文
关键词
Sparse principal component analysis, Stochastic blockmodel, Mixed memberships, Primary: 62H30, Secondary: 91C20, 68T10
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络