A new algorithm and theory for penalized regression-based clustering
From MaRDI portal
Recommendations
- A novel heuristic algorithm to solve penalized regression-based clustering model
- Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
- Solution path clustering with adaptive concave penalty
- A novel convex clustering method for high-dimensional data using semiproximal ADMM
- Sparse regression with exact clustering
Cited in
(18)- DC programming and DCA: thirty years of developments
- A novel heuristic algorithm to solve penalized regression-based clustering model
- On the nonparametric maximum likelihood estimator for Gaussian location mixture densities with application to Gaussian denoising
- Convex clustering for binary data
- Group-wise shrinkage estimation in penalized model-based clustering
- Penalized Probabilistic Clustering
- Solution path clustering with adaptive concave penalty
- Integrative generalized convex clustering optimization and feature selection for mixed multi-view data
- Recovering Trees with Convex Clustering
- Block-Wise Variable Selection for Clustering Via Latent States of Mixture Models
- Mechanism and a new algorithm for nonconvex clustering
- scientific article; zbMATH DE number 7306902 (Why is no real title available?)
- Simultaneous Cluster Structure Learning and Estimation of Heterogeneous Graphs for Matrix-Variate fMRI Data
- Clustering High-Dimensional Data via Feature Selection
- Learning latent and hierarchical structures in cognitive diagnosis models
- Robust analysis of cancer heterogeneity for high-dimensional data
- Subgroup effect quantile regression with high dimensional missing panel data
- Unsupervised sparse multi-task learning with application to Alzheimer's disease
This page was built for publication: A new algorithm and theory for penalized regression-based clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834531)
