Convex clustering via l₁ fusion penalization
From MaRDI portal
Abstract: We study the large sample behavior of a convex clustering framework, which minimizes the sample within cluster sum of squares under an~ fusion constraint on the cluster centroids. This recently proposed approach has been gaining in popularity, however, its asymptotic properties have remained mostly unknown. Our analysis is based on a novel representation of the sample clustering procedure as a sequence of cluster splits determined by a sequence of maximization problems. We use this representation to provide a simple and intuitive formulation for the population clustering procedure. We then demonstrate that the sample procedure consistently estimates its population analog, and derive the corresponding rates of convergence. The proof conducts a careful simultaneous analysis of a collection of M-estimation problems, whose cardinality grows together with the sample size. Based on the new perspectives gained from the asymptotic investigation, we propose a key post-processing modification of the original clustering framework. We show, both theoretically and empirically, that the resulting approach can be successfully used to estimate the number of clusters in the population. Using simulated data, we compare the proposed method with existing number of clusters and modality assessment approaches, and obtain encouraging results. We also demonstrate the applicability of our clustering method for the detection of cellular subpopulations in a single-cell virology study.
Recommendations
Cited in
(24)- Clustering multivariate count data via Dirichlet-multinomial network fusion
- A forward k-means algorithm for regression clustering
- Panel data quantile regression with grouped fixed effects
- Biconvex Clustering
- Resistant convex clustering: how does the fusion penalty enhance resistance?
- A novel convex clustering method for high-dimensional data using semiproximal ADMM
- Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
- Adaptive Convex Clustering of Generalized Linear Models With Application in Purchase Likelihood Prediction
- Convex clustering for binary data
- scientific article; zbMATH DE number 7370526 (Why is no real title available?)
- scientific article; zbMATH DE number 7370572 (Why is no real title available?)
- A dual reformulation and solution framework for regularized convex clustering problems
- On convex clustering: convexity, bounding balls and characteristics
- Regulation-incorporated gene expression network-based heterogeneity analysis
- Heterogeneous analysis for clustered data using grouped finite mixture models
- Estimation and clustering for partially heterogeneous single index model
- Feature screening for clustering analysis of count data with an application to single-cell RNA-sequencing
- Randomly projected convex clustering model: motivation, realization, and cluster recovery guarantees
- scientific article; zbMATH DE number 7307486 (Why is no real title available?)
- scientific article; zbMATH DE number 7306902 (Why is no real title available?)
- Recovering Trees with Convex Clustering
- Solving Fused Penalty Estimation Problems via Block Splitting Algorithms
- Feature screening in large scale cluster analysis
- Identifying latent group structures in nonlinear panels
This page was built for publication: Convex clustering via \(l_1\) fusion penalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603797)
