A novel convex clustering method for high-dimensional data using semiproximal ADMM
Summary: Clustering is an important ingredient of unsupervised learning; classical clustering methods include K-means clustering and hierarchical clustering. These methods may suffer from instability because of their tendency prone to sink into the local optimal solutions of the nonconvex optimization model. In this paper, we propose a new convex clustering method for high-dimensional data based on the sparse group lasso penalty, which can simultaneously group observations and eliminate noninformative features. In this method, the number of clusters can be learned from the data instead of being given in advance as a parameter. We theoretically prove that the proposed method has desirable statistical properties, including a finite sample error bound and feature screening consistency. Furthermore, the semiproximal alternating direction method of multipliers is designed to solve the sparse group lasso convex clustering model, and its convergence analysis is established without any conditions. Finally, the effectiveness of the proposed method is thoroughly demonstrated through simulated experiments and real applications.
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
- Solution path clustering with adaptive concave penalty
- A dual reformulation and solution framework for regularized convex clustering problems
- Regularized k-means clustering of high-dimensional data and its asymptotic consistency
- Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Method for Comparing Two Hierarchical Clusterings
- A note on adaptive group Lasso
- Advances in k-means clustering. A data mining thinking.
- An easy path to convex analysis and applications
- Approximate Evaluation Techniques for the Single-Link and Complete-Link Hierarchical Clustering Procedures
- Convex clustering for binary data
- Convex clustering via l₁ fusion penalization
- Hankel matrix rank minimization with applications to system identification and realization
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Model Selection and Estimation in Regression with Grouped Variables
- Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension
- Recovering Trees with Convex Clustering
- Regularization and Variable Selection Via the Elastic Net
- Sparse Convex Clustering
- Statistical properties of convex clustering
- The Adaptive Lasso and Its Oracle Properties
- Bayesian sparse convex clustering via global-local shrinkage priors
- Convex clustering method for compositional data modeling
- Robust and sparse \(k\)-means clustering for high-dimensional data
- Convex clustering for binary data
- A new algorithm and theory for penalized regression-based clustering
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
- Solution path clustering with adaptive concave penalty
- Non-convex clustering via proximal alternating linearized minimization method
- Integrative generalized convex clustering optimization and feature selection for mixed multi-view data
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- Adaptive sufficient sparse clustering by controlling false discovery
- Group sparsity-based fusion regularized clustering: new model and convergent algorithm
This page was built for publication: A novel convex clustering method for high-dimensional data using semiproximal ADMM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004149)
