A novel convex clustering method for high-dimensional data using semiproximal ADMM
From MaRDI portal
Publication:2004149
Recommendations
- 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
Cites work
- 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?)
- A Method for Comparing Two Hierarchical Clusterings
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- 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_1\) fusion penalization
- Hankel matrix rank minimization with applications to system identification and realization
- 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
Cited in
(10)- Robust and sparse \(k\)-means clustering for high-dimensional data
- Bayesian sparse convex clustering via global-local shrinkage priors
- Convex clustering method for compositional data modeling
- Non-convex clustering via proximal alternating linearized minimization method
- Adaptive sufficient sparse clustering by controlling false discovery
- Convex clustering for binary data
- A new algorithm and theory for penalized regression-based clustering
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- Solution path clustering with adaptive concave penalty
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
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)
