Robust Graph Regularized Nonnegative Matrix Factorization for Clustering

Chong Peng

doi:10.1145/3003730

Robust Graph Regularized Nonnegative Matrix Factorization for Clustering

2017-03-06

43

PRE

AI

DOI：10.1145/3003730

Original request for help

Save

Abstract

En 中文

Matrix factorization is often used for data representation in many data mining and machine-learning problems. In particular, for a dataset without any negative entries, nonnegative matrix factorization (NMF) is often used to find a low-rank approximation by the product of two nonnegative matrices. With reduced dimensions, these matrices can be effectively used for many applications such as clustering. The existing methods of NMF are often afflicted with their sensitivity to outliers and noise in the data. To mitigate this drawback, in this paper, we consider integrating NMF into a robust principal component model, and design a robust formulation that effectively captures noise and outliers in the approximation while incorporating essential nonlinear structures. A set of comprehensive empirical evaluations in clustering applications demonstrates that the proposed method has strong robustness to gross errors and superior performance to current state-of-the-art methods.

Keywords:

Nonnegative factorization

robust principal component analysis

manifold

clustering

Robust Graph Regularized Nonnegative Matrix Factorization for Clustering

Abstract

AI Summary

Journal

Organization