Robust Nonnegative Matrix Factorization via Half-Quadratic Minimization

Abstract

Nonnegative matrix factorization (NMF) is a popular technique for learning parts-based representation and data clustering. It usually uses the squared residuals to quantify the quality of factorization, which is optimal specifically to zero-mean, Gaussian noise and sensitive to outliers in general cases. In this paper, we propose a robust NMF method based on the correntropy induced metric, which is much more insensitive to outliers. A half-quadratic optimization algorithm is developed to solve the proposed problem efficiently. The proposed method is further extended to handle outlier rows by incorporating structural knowledge about the outliers. Experimental results on data sets with and without apparent outliers demonstrate the effectiveness of the proposed algorithms.

DOI: 10.1109/ICDM.2012.39

Extracted Key Phrases

6 Figures and Tables

01020201520162017
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Du2012RobustNM, title={Robust Nonnegative Matrix Factorization via Half-Quadratic Minimization}, author={Liang Du and Xuan Li and Yi-Dong Shen}, journal={2012 IEEE 12th International Conference on Data Mining}, year={2012}, pages={201-210} }