TY - JOUR
T1 - Bayesian sparse convex clustering via global-local shrinkage priors
AU - Shimamura, Kaito
AU - Kawano, Shuichi
N1 - Publisher Copyright:
© 2021, The Author(s).
PY - 2021/12
Y1 - 2021/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85103667138&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85103667138&partnerID=8YFLogxK
U2 - 10.1007/s00180-021-01101-7
DO - 10.1007/s00180-021-01101-7
M3 - Article
AN - SCOPUS:85103667138
SN - 0943-4062
VL - 36
SP - 2671
EP - 2699
JO - Computational Statistics
JF - Computational Statistics
IS - 4
ER -