Solution path clustering with adaptive concave penalty
From MaRDI portal
(Redirected from Publication:457964)
Abstract: Fast accumulation of large amounts of complex data has created a need for more sophisticated statistical methodologies to discover interesting patterns and better extract information from these data. The large scale of the data often results in challenging high-dimensional estimation problems where only a minority of the data shows specific grouping patterns. To address these emerging challenges, we develop a new clustering methodology that introduces the idea of a regularization path into unsupervised learning. A regularization path for a clustering problem is created by varying the degree of sparsity constraint that is imposed on the differences between objects via the minimax concave penalty with adaptive tuning parameters. Instead of providing a single solution represented by a cluster assignment for each object, the method produces a short sequence of solutions that determines not only the cluster assignment but also a corresponding number of clusters for each solution. The optimization of the penalized loss function is carried out through an MM algorithm with block coordinate descent. The advantages of this clustering algorithm compared to other existing methods are as follows: it does not require the input of the number of clusters; it is capable of simultaneously separating irrelevant or noisy observations that show no grouping pattern, which can greatly improve data interpretation; it is a general methodology that can be applied to many clustering problems. We test this method on various simulated datasets and on gene expression data, where it shows better or competitive performance compared against several clustering methods.
Recommendations
- A novel convex clustering method for high-dimensional data using semiproximal ADMM
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
- Iterative subsampling in solution path clustering of noisy big data
- Penalized model-based clustering with unconstrained covariance matrices
- A new algorithm and theory for penalized regression-based clustering
Cites work
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 1810276 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 739537 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A coordinate gradient descent method for nonsmooth separable minimization
- A framework for feature selection in clustering
- A general trimming approach to robust cluster analysis
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
- Clustering in the Presence of Scatter
- Coordinate descent algorithms for lasso penalized regression
- Data clustering. Algorithms and applications
- Estimating the number of clusters in a data set via the gap statistic
- God, king, and geometry: revisiting the introduction to Cauchy's \textit{Cours d'analyse}
- Handling missing values in support vector machine classifiers
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- Least angle regression. (With discussion)
- Model Selection and Estimation in Regression with Grouped Variables
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes
- Nearly unbiased variable selection under minimax concave penalty
- Nonparametric clustering of functional data
- Pairwise Variable Selection for High-Dimensional Model-Based Clustering
- Pathwise coordinate optimization
- Penalized model-based clustering with application to variable selection
- Penalized model-based clustering with unconstrained covariance matrices
- Regularization and Variable Selection Via the Elastic Net
- Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
- Robust Clustering Using Outlier-Sparsity Regularization
- Selection of the number of clusters via the bootstrap method
- SparseNet: coordinate descent with nonconvex penalties
- Sparsity and Smoothness Via the Fused Lasso
- Tight Clustering: A Resampling‐Based Approach for Identifying Stable and Tight Patterns in Data
- Variable Selection for Model-Based High-Dimensional Clustering and Its Application to Microarray Data
- Variable Selection in Penalized Model‐Based Clustering Via Regularization on Grouped Parameters
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(10)- A novel convex clustering method for high-dimensional data using semiproximal ADMM
- Mechanism and a new algorithm for nonconvex clustering
- Iterative subsampling in solution path clustering of noisy big data
- A new algorithm and theory for penalized regression-based clustering
- Clustering of subsample means based on pairwise L1 regularized empirical likelihood
- Adaptive sufficient sparse clustering by controlling false discovery
- Data filtering for cluster analysis by \(\ell _0\)-norm regularization
- scientific article; zbMATH DE number 7306902 (Why is no real title available?)
- Recovering Trees with Convex Clustering
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
This page was built for publication: Solution path clustering with adaptive concave penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457964)
