Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
zbMATH Open1317.68179MaRDI QIDQ2933869FDOQ2933869
Binghui Liu, Wei Pan, Xiaotong Shen
Publication date: 8 December 2014
Full work available at URL: http://jmlr.csail.mit.edu/papers/v14/pan13a.html
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
Lassopenalized regressiongroupingK-means clusteringgeneralized degrees of freedomtruncated Lasso penalty (TLP)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Ridge regression; shrinkage estimators (Lasso) (62J07)
Cited In (26)
- Simultaneous Cluster Structure Learning and Estimation of Heterogeneous Graphs for Matrix-Variate fMRI Data
- Heterogeneous quantile regression for longitudinal data with subgroup structures
- Mechanism and a new algorithm for nonconvex clustering
- Unsupervised learning of arbitrarily shaped clusters using ensembles of Gaussian models
- Cluster analysis of longitudinal profiles with subgroups
- Convex clustering for binary data
- DC programming and DCA: thirty years of developments
- Regularized boxplot via convex clustering
- Detecting communities in attributed networks through bi-direction penalized clustering and its application
- Solution path clustering with adaptive concave penalty
- A novel heuristic algorithm to solve penalized regression-based clustering model
- Nonparametric Prediction Distribution from Resolution-Wise Regression with Heterogeneous Data
- Model-based feature selection and clustering of RNA-seq data for unsupervised subtype discovery
- Clustering of subsample means based on pairwise L1 regularized empirical likelihood
- Small area mean estimation after effect clustering
- Improved approximation algorithm for the distributed lower-bounded \(k\)-center problem
- Title not available (Why is that?)
- Recovering Trees with Convex Clustering
- The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space
- Data filtering for cluster analysis by \(\ell _0\)-norm regularization
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning
- Title not available (Why is that?)
- Logical and test consistency in pairwise multiple comparisons
- Subgroup analysis for heterogeneous additive partially linear models and its application to car sales data
- Individualized Multidirectional Variable Selection
- Multiply robust subgroup identification for longitudinal data with dropouts via median regression
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)
