1. Maximum Correntropy Criterion-Based Sparse Subspace Learning for Unsupervised Feature Selection.
- Author
-
Zhou, Nan, Xu, Yangyang, Cheng, Hong, Yuan, Zejian, and Chen, Badong
- Subjects
- *
MACHINE learning , *IMAGE processing , *DATA mining , *NUMERICAL analysis , *MATHEMATICAL optimization , *SUBSPACES (Mathematics) - Abstract
High-dimensional data contain not only redundancy but also noises produced by the sensors. These noises are usually non-Gaussian distributed. The metrics based on Euclidean distance are not suitable for these situations in general. In order to select the useful features and combat the adverse effects of the noises simultaneously, a robust sparse subspace learning method in unsupervised scenario is proposed in this paper based on the maximum correntropy criterion that shows strong robustness against outliers. Furthermore, an iterative strategy based on half quadratic and an accelerated block coordinate update is proposed. The convergence analysis of the proposed method is also carried out to ensure the convergence to a reliable solution. Extensive experiments are conducted on real-world data sets to show that the new method can filter out the outliers and outperform several state-of-the-art unsupervised feature selection methods. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF