首页|Nonconvex clustering via l(0) fusion penalized regression
Nonconvex clustering via l(0) fusion penalized regression
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
Cluster analysis has attracted widespread attention in the past several decades. Generally speaking, clus-tering is considered as an important unsupervised learning method because its goal is to discover unknown subgroups in data without category label information. In this paper, we propose the l(0) fusion penalized clustering model (l(0)-PClust), which is a novel clustering framework founded on the penalized regression method. Theoretically, we first analyze the existence of the optimal solutions of our model and deduce an upper bound of the tuning parameter. Then we define the Karush-Kuhn-Tucker point and P-stationary point of the l(0)-PClust model, and establish the relationship between them and local optimal solutions. Moreover, based on the P-stationary point of the l(0)-PClust model, we prove that the distances among different cluster centers are greater than a positive threshold. Computationally, we solve the l(0)-PClust model via the famous alternating direction method of multipliers, whose limit point is a P-stationary point and local optimal solution of the model. Finally, we conduct extensive experiments on both synthetic and real data sets. Experimental results show outstanding performance of our method in comparison with several state-of-the-art clustering methods. (C)& nbsp;2022 Elsevier Ltd. All rights reserved.
Penalized clusteringl(0) fusion penaltyNonconvex discontinuous optimizationAlternating direction method of multipliersLIKELIHOODSELECTION
NSTL
Elsevier
