Finding Dense Clusters via "Low Rank + Sparse" Decomposition

Abstract

Finding "densely connected clusters" in a graph is in general an important and well studied problem in the literature \cite{Schaeffer}. It has various applications in pattern recognition, social networking and data mining \cite{Duda,Mishra}. Recently, Ames and Vavasis have suggested a novel method for finding cliques in a graph by using convex optimization over the adjacency matrix of the graph \cite{Ames, Ames2}. Also, there has been recent advances in decomposing a given matrix into its "low rank" and "sparse" components \cite{Candes, Chandra}. In this paper, inspired by these results, we view "densely connected clusters" as imperfect cliques, where imperfections correspond missing edges, which are relatively sparse. We analyze the problem in a probabilistic setting and aim to detect disjointly planted clusters. Our main result basically suggests that, one can find \emph{dense} clusters in a graph, as long as the clusters are sufficiently large. We conclude by discussing possible extensions and future research directions.

19 pages, 2 figures

References in corpus (1)

• Latent variable graphical model selection via convex optimization

Cited by in corpus (17)

• OptShrink: An algorithm for improved low-rank signal matrix denoising by optimal, data-driven singular value shrinkage
• Clustering Partially Observed Graphs via Convex Optimization
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Guaranteed clustering and biclustering via semidefinite programming
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
• Exact Recovery in the Hypergraph Stochastic Block Model: a Spectral Algorithm
• Breaking the Small Cluster Barrier of Graph Clustering
• The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
• Unified ${\ell }_{2\to \infty }$ Eigenspace Perturbation Theory for Symmetric Random Matrices
• The blessing of transitivity in sparse and stochastic networks
• Mixed Membership Graph Clustering via Systematic Edge Query
• Convex optimization for the planted k-disjoint-clique problem
• Convex Relaxation Methods for Community Detection
• Recovery guarantees for exemplar-based clustering
• Exponential error rates of SDP for block models: Beyond Grothendieck's inequality
• A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection
• A Simple Spectral Algorithm for Recovering Planted Partitions