Sparse Convex Clustering

DOI10.1080/10618600.2017.1377081OpenAlexW2949561674MaRDI QIDQ3391120

Binhuan Wang, Yixin Fang, Yilong Zhang, Wei Sun

Publication date: 28 March 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.04586

zbMATH Keywords

sparsitygroup Lassohigh-dimensionalityconvex clusteringfinite sample error

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items

Bayesian sparse convex clustering via global-local shrinkage priors ⋮ Convex clustering method for compositional data modeling ⋮ Hierarchical cancer heterogeneity analysis based on histopathological imaging features ⋮ Unnamed Item ⋮ Biconvex Clustering ⋮ On the nonparametric maximum likelihood estimator for Gaussian location mixture densities with application to Gaussian denoising ⋮ Gaussian graphical model‐based heterogeneity analysis via penalized fusion ⋮ A novel convex clustering method for high-dimensional data using semiproximal ADMM ⋮ A dual reformulation and solution framework for regularized convex clustering problems ⋮ Sparse group fused Lasso for model segmentation: a hybrid approach ⋮ Sparse principal component regression via singular value decomposition approach ⋮ Unnamed Item ⋮ Converting ADMM to a proximal gradient for efficient sparse estimation ⋮ Recovering Trees with Convex Clustering

Uses Software

• UCI-ml
• sparcl
• clusterpath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• The Adaptive Lasso and Its Oracle Properties
• Sparse optimal discriminant clustering
• Selection of the number of clusters via the bootstrap method
• Statistical properties of convex clustering
• A note on adaptive group Lasso
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
• Pairwise Variable Selection for High-Dimensional Model-Based Clustering
• Consistent selection of the number of clusters via crossvalidation
• Variable Selection for Model-Based High-Dimensional Clustering and Its Application to Microarray Data
• Variable Selection in Penalized Model‐Based Clustering Via Regularization on Grouped Parameters
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Sparsity and Smoothness Via the Fused Lasso
• A Framework for Feature Selection in Clustering
• Convex biclustering
• Model Selection and Estimation in Regression with Grouped Variables
• Variable Selection for Model-Based Clustering