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