Detecting Overlapping Communities from Local Spectral Subspaces
Not on the map. Why?
Abstract (arXiv)
Based on the definition of local spectral subspace, we propose a novel approach called LOSP for local overlapping community detection. Instead of using the invariant subspace spanned by the dominant eigenvectors of the entire network, we run the power method for a few steps to approximate the leading eigenvectors that depict the embedding of the local neighborhood structure around seeds of interest. We then seek a sparse approximate indicator vector in the local spectral subspace spanned by these vectors such that the seeds are in its support. We evaluate LOSP on five large real world networks across various domains with labeled ground-truth communities and compare the results with the state-of-the-art community detection approaches. LOSP identifies the members of a target community with high accuracy from very few seed members, and outperforms the local Heat Kernel or PageRank diffusions as well as the global baselines. Two candidate definitions of the local spectral subspace are analyzed, and different community scoring functions for determining the community boundary, including two new metrics, are thoroughly evaluated. The structural properties of different seed sets and the impact of the seed set size are discussed. We observe low degree seeds behave better, and LOSP is robust even when started from a single random seed. Using LOSP as a subroutine and starting from each ego connected component, we try the harder yet significant task of identifying all communities a single vertex is in. Experiments show that the proposed method achieves high F1 measures on the detected multiple local overlapping communities containing the seed vertex.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Sep 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 3.
6 papers.
- 2024ARGS: Alignment as Reward-Guided Searchcited by 103
- 2024Process Reward Model with Q-Value Rankingscited by 80
- 2021Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactionscited by 21
- 2024On the Learnability of Out-of-distribution Detectioncited by 8
- 2021Uncovering the Local Hidden Community Structure in Social Networkscited by 0
- 2022Machine-Learning Based Objective Function Selection for Community Detectioncited by 0
- 2024Process Reward Model with Q-Value Rankings15 Oct 2024
- 2024On the Learnability of Out-of-distribution Detection7 Apr 2024
- 2024ARGS: Alignment as Reward-Guided Search23 Jan 2024
- 2022Machine-Learning Based Objective Function Selection for Community Detection25 Mar 2022
- 2021Uncovering the Local Hidden Community Structure in Social Networks8 Dec 2021
- 2021Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions14 Jun 2021