Conceptual

Double Sparsity Constrained Optimization for Unsupervised Feature Selection

An unsupervised feature-selection method (DSCOFS) that embeds two simultaneous sparsity constraints, an l2,0-norm and an l0-norm, into the principal component analysis framework, so the l2,0 term drops irrelevant and redundant features while the l0 term filters irregular noisy ones. The resulting nonconvex, nonsmooth problem is solved by a proximal alternating minimization scheme proven to converge globally to a stationary point, improving clustering accuracy and mutual information over single-sparsity methods.