Robust Graph Regularized Nonnegative Matrix Factorization

Nonnegative Matrix Factorization (NMF) has become a popular technique for dimensionality reduction, and been widely used in machine learning, computer vision, and data mining. Existing unsupervised NMF methods impose the intrinsic geometric constraint on the encoding matrix, which only indirectly affects the base matrix. Moreover, they ignore the global structure of the data space. To address these issues, in this paper we propose a novel unsupervised NMF learning framework, called Robust Graph regularized Nonnegative Matrix Factorization (RGNMF). RGNMF constructs a sparse graph imposed on the basis matrix to catch the global structure and preserve the discriminative information. And it models the local structure by building a k-NN graph constrained on the encoding matrix, which gains the compact representation. Consequently, RGNMF not only respects the global structure, but also depicts the local structure. In addition, it employs such a <inline-formula> <tex-math notation="LaTeX">$\text{L}_{2,1}$ </tex-math></inline-formula>-norm cost function to decompose the basis matrix and encoding matrix that its robustness can be improved. Further, it imposes the <inline-formula> <tex-math notation="LaTeX">$\text{L}_{2,1}$ </tex-math></inline-formula>-norm constraint on the basis matrix to choose the discriminative feature. Hence, RGNMF can gain the robust discriminative representation by combining structure learning and <inline-formula> <tex-math notation="LaTeX">$\text{L}_{2,1}$ </tex-math></inline-formula>-norm constraints imposed on the basis matrix and encoding matrix. Extensive experiments on real-world problems demonstrate that RGNMF achieves better clustering results than the state-of-the-art approaches.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.