Local Graph Clustering with Network Lasso
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringGraph ClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
The Cluster Graphical Lasso for improved estimation of Gaussian graphical models
We consider the task of estimating a Gaussian graphical model in the high-dimensional setting. The graphical lasso, which involves maximizing the Gaussian log likelihood subject to an l1 penalty, is a well-studied approa…
ClusteringModel SelectionOn the Duality between Network Flows and Network Lasso
Many applications generate data with an intrinsic network structure such as time series data, image data or social network data. The network Lasso (nLasso) has been proposed recently as a method for joint clustering and …
ClusteringTime SeriesTime Series AnalysisStatistical control for spatio-temporal MEG/EEG source imaging with desparsified multi-task Lasso
Detecting where and when brain regions activate in a cognitive task or in a given clinical condition is the promise of non-invasive techniques like magnetoencephalography (MEG) or electroencephalography (EEG). This probl…
ClusteringConstrained ClusteringEEGElectroencephalogram (EEG)+2Statistical control for spatio-temporal MEG/EEG source imaging with desparsified mutli-task Lasso
Detecting where and when brain regions activate in a cognitive task or in a given clinical condition is the promise of non-invasive techniques like magnetoencephalography (MEG) or electroencephalography (EEG). This probl…
ClusteringConstrained ClusteringEEGElectroencephalogram (EEG)+2Analysis of Network Lasso for Semi-Supervised Regression
We apply network Lasso to semi-supervised regression problems involving network structured data. This approach lends quite naturally to highly scalable learning algorithms in the form of message passing over an empirical…
Clusteringregression