mlsanityData to 7 Oct 2026

Local Graph Clustering with Network Lasso

arXiv 2004.12199 ↗First posted 25 Apr 2020cs.LG stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

We study the statistical and computational properties of a network Lasso method for local graph clustering. The clusters delivered by nLasso can be characterized elegantly via network flows between cluster boundary and seed nodes. While spectral clustering methods are guided by a minimization of the graph Laplacian quadratic form, nLasso minimizes the total variation of cluster indicator signals. As demonstrated theoretically and numerically, nLasso methods can handle very sparse clusters (chain-like) which are difficult for spectral clustering. We also verify that a primal-dual method for nonsmooth optimization allows to approximate nLasso solutions with optimal worst-case convergence rate.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 10; 2022: 4; 2023: 1; 2024: 0; 2025: 1.

16 papers.

Sort: