A fast algorithm for nonsmooth penalized clustering
Sign Up to like & getrecommendations! Published in 2018 at "Neurocomputing"
DOI: 10.1016/j.neucom.2017.08.048
Abstract: Abstract As a novel framework of clustering analysis, penalized clustering is able to learn the number of clusters automatically, and therefore has aroused widespread interest recently. To address the computational difficulties arising from the nonsmoothness… read more here.
Keywords: algorithm nonsmooth; fast algorithm; nonsmooth penalized; penalized clustering ... See more keywords
ℓ1/2-based Penalized Clustering with Half Thresholding Algorithm
Sign Up to like & getrecommendations! Published in 2020 at "Neurocomputing"
DOI: 10.1016/j.neucom.2020.01.058
Abstract: Abstract 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… read more here.
Keywords: clustering half; based penalized; penalized clustering; half thresholding ... See more keywords