arrow
Return

l1/2-based penalized clustering with half thresholding algorithm

delete2020-07-01
delete3
PRE
AI
X
Xingwei Wang
张红娟 cover
张红娟 (Hongjuan Zhang) *
DOI:10.1016/j.neucom.2020.01.058delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Clustering is a widely applied method in data analysis. As a novel framework of clustering analysis, penalized clustering bases itself on the sparsity of solution, which contributes to its ability of determining the best number of clusters automatically rather than specified in advance. Moreover, l(1/2) regularization has been recognized extensively in recent studies. Compared with other l(p) (0 < p < 1) regularization, it can always obtain sparser solution. Motivated by these two points, we propose a l(1/2)-basedpenalized clustering model, and further transform it into a more general form by introducing the vector comprising pairwise differences between centroids and an auxiliary transfer matrix composed of identity matrixes and null matrixes. Finally, the transformed model is solved by the efficient half thresholding algorithm, which can not only obtain an exact analytic expression of l(1/2) solutions, but also provide an effective parameter selection strategy. We also prove the convergence of the proposed half thresholding algorithm solving l(1/2)-based penalized clustering model. Lastly but not least importantly, benchmark experiments on both synthesis and real data sets from UCI have been conducted to prove the superiority of the proposed method. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Half thresholding algorithm
l(1/2) regularization
Penalized clustering
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

S
shanghai university
Scholars:
3.9W
Papers: 2.7W
Citations: 52
Cited Papers

Cited Papers

Low-rank kernel learning for graph-based clustering
err2019-01-01
err150
errOAAI
errKang, Zhao; Wen, Liangjian; Chen, Wenyu; Xu, Zenglin
errShare
errSave
Study on a new split type of HEV powertrains
err2005-01-01
err0
PREAI
errHuang Xiangdong; Zhao Kegang; Luo Yutao; Liu Wenbin
errShare
errSave
Enantioselective Energy Transfer-Enabled Cyclization using a Privileged Al-Salen Photocatalyst
err
IF0
err2024-10-07
err0
errOAAI
errJulia Soika; Carina Onneken; Thorben Wiegmann; Tobias Morack; Leander Lindfeld; Marian Hebenbrock; Christian Mück-Lichtenfeld; Johannes Neugebauer; Ryan Gilmour
errShare
errSave
Physical, chemical and electric characterization of thermally treated rice husk ash and its potential application as ceramic raw material
err2017-04-01
err0
PREAI
errIara J. Fernandes; Felipe A.L. Sánchez; José R. Jurado; Amanda G. Kieling; Tatiana L.A.C. Rocha; Carlos A.M. Moraes; Vânia C. Sousa
errShare
errSave
Locally Weighted Ensemble Clustering
err2018-05-01
err282
errOAAI
errHuang, Dong; Wang, Chang-Dong; Lai, Jian-Huang
errShare
errSave
Management and the Gospel
err
IF0
err2013-01-01
err0
PREAI
errBruno Dyck
errShare
errSave
Gas Turbine Performance
err
IF0
err2008-02-11
err0
PREAI
errPhilip P. Walsh; Paul Fletcher
errShare
errSave
Improving RBF networks performance in regression tasks by means of a supervised fuzzy clustering
err2006-08-01
err91
PREAI
errStaiano, Antonino; Tagliaferri, Roberto; Pedrycz, Witold
errShare
errSave
A sparse fuzzy c-means algorithm based on sparse clustering framework
err2015-06-01
err26
PREAI
errQiu, Xianen; Qiu, Yanyi; Feng, Guocan; Li, Peixing
errShare
errSave
researcher View more