Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
From MaRDI portal
Recommendations
- A novel convex clustering method for high-dimensional data using semiproximal ADMM
- Solution path clustering with adaptive concave penalty
- Penalized model-based clustering with application to variable selection
- Penalized model-based clustering with unconstrained covariance matrices
- Variable Selection in Penalized Model‐Based Clustering Via Regularization on Grouped Parameters
Cited in
(40)- Data filtering for cluster analysis by \(\ell _0\)-norm regularization
- Cluster analysis of longitudinal profiles with subgroups
- DC programming and DCA: thirty years of developments
- A novel convex clustering method for high-dimensional data using semiproximal ADMM
- Clustering of subsample means based on pairwise L1 regularized empirical likelihood
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning
- A novel heuristic algorithm to solve penalized regression-based clustering model
- Model-based feature selection and clustering of RNA-seq data for unsupervised subtype discovery
- Logical and test consistency in pairwise multiple comparisons
- Convex clustering for binary data
- Subgroup analysis for heterogeneous additive partially linear models and its application to car sales data
- Multiply robust subgroup identification for longitudinal data with dropouts via median regression
- A new algorithm and theory for penalized regression-based clustering
- Simultaneous supervised and unsupervised classification modeling for assessing cluster analysis and improving results interpretability
- Solution path clustering with adaptive concave penalty
- Convex clustering via l₁ fusion penalization
- Longitudinal clustering for heterogeneous binary data
- Recovering Trees with Convex Clustering
- Small area mean estimation after effect clustering
- On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications
- Regularized boxplot via convex clustering
- Mechanism and a new algorithm for nonconvex clustering
- scientific article; zbMATH DE number 7306902 (Why is no real title available?)
- Individualized Multidirectional Variable Selection
- Simultaneous Cluster Structure Learning and Estimation of Heterogeneous Graphs for Matrix-Variate fMRI Data
- Detecting communities in attributed networks through bi-direction penalized clustering and its application
- Nonparametric Prediction Distribution from Resolution-Wise Regression with Heterogeneous Data
- Heterogeneous quantile regression for longitudinal data with subgroup structures
- Improved approximation algorithm for the distributed lower-bounded k-center problem
- The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space
- Subgroup effect quantile regression with high dimensional missing panel data
- Spatial Heterogeneous Additive Partial Linear Model: A Joint Approach of Bivariate Spline and Forest Lasso
- Coresets for k-median of lines with group fairness constraints
- Data-driven segmentation of observation-level logistic regression models
- Cluster analysis of longitudinal profiles for compositional count data
- Individualized time-varying nonparametric model with an application in mobile health
- Efficient coreset construction algorithm for fair k-median of lines
- Regression coefficients clustering for longitudinal data in the presence of heteroscedasticity
- Unsupervised learning of arbitrarily shaped clusters using ensembles of Gaussian models
- Penalized cluster analysis with applications to family data
This page was built for publication: Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933869)
