A novel convex clustering method for high-dimensional data using semiproximal ADMM
DOI10.1155/2020/9216351zbMATH Open1459.62108OpenAlexW3087596862MaRDI QIDQ2004149FDOQ2004149
Authors: Huangyue Chen, Lingchen Kong, Yan Li 
Publication date: 14 October 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/9216351
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
Nonparametric regression and quantile regression (62G08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Ridge regression; shrinkage estimators (Lasso) (62J07)
Cites Work
- The Adaptive Lasso and Its Oracle Properties
- Title not available (Why is that?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Regularization and Variable Selection Via the Elastic Net
- Model Selection and Estimation in Regression with Grouped Variables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension
- Hankel matrix rank minimization with applications to system identification and realization
- Convex clustering via \(l_1\) fusion penalization
- Title not available (Why is that?)
- An easy path to convex analysis and applications
- A note on adaptive group Lasso
- A Method for Comparing Two Hierarchical Clusterings
- Advances in \(k\)-means clustering. A data mining thinking.
- Approximate Evaluation Techniques for the Single-Link and Complete-Link Hierarchical Clustering Procedures
- Statistical properties of convex clustering
- Sparse Convex Clustering
- Convex clustering for binary data
- Recovering Trees with Convex Clustering
Cited In (10)
- Convex clustering for binary data
- Bayesian sparse convex clustering via global-local shrinkage priors
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- Solution path clustering with adaptive concave penalty
- Convex clustering method for compositional data modeling
- Non-convex clustering via proximal alternating linearized minimization method
- Robust and sparse \(k\)-means clustering for high-dimensional data
- A new algorithm and theory for penalized regression-based clustering
- Adaptive sufficient sparse clustering by controlling false discovery
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
Uses Software
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)
