Name
Abstract | ||
|---|---|---|
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 boundaries 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 non-smooth optimization allows to approximate nLasso solutions with optimal worst-case convergence rate. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/LSP.2020.3045832 | IEEE Signal Processing Letters |
Keywords | DocType | Volume |
Clustering algorithms,distributed algorithms,flow graphs,machine learning,network theory (graphs),semisupervised learning | Journal | 28 |
ISSN | Citations | PageRank |
1070-9908 | 0 | 0.34 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Jung | 1 | 13 | 3.46 |