Abstract
Sparse convex clustering is to group observations and conduct variable selection simultaneously in the framework of convex clustering. Although a weighted L1 norm is usually employed for the regularization term in sparse convex clustering, its use increases the dependence on the data and reduces the estimation accuracy if the sample size is not sufficient. To tackle these problems, this paper proposes a Bayesian sparse convex clustering method based on the ideas of Bayesian lasso and global-local shrinkage priors. We introduce Gibbs sampling algorithms for our method using scale mixtures of normal distributions. The effectiveness of the proposed methods is shown in simulation studies and a real data analysis.
Original language | English |
---|---|
Pages (from-to) | 2671-2699 |
Number of pages | 29 |
Journal | Computational Statistics |
Volume | 36 |
Issue number | 4 |
DOIs | |
Publication status | Published - Dec 2021 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Computational Mathematics