Graph Regularized Nonnegative Matrix Factorization for Data Representation

Abstract

Matrix factorization techniques have been frequently applied in information retrieval, computer vision, and pattern recognition. Among them, Nonnegative Matrix Factorization (NMF) has received considerable attention due to its psychological and physiological interpretation of naturally occurring data whose representation may be parts based in the human brain. On the other hand, from the geometric perspective, the data is usually sampled from a low-dimensional manifold embedded in a high-dimensional ambient space. One then hopes to find a compact representation,which uncovers the hidden semantics and simultaneously respects the intrinsic geometric structure. In this paper, we propose a novel algorithm, called Graph Regularized Nonnegative Matrix Factorization (GNMF), for this purpose. In GNMF, an affinity graph is constructed to encode the geometrical information and we seek a matrix factorization, which respects the graph structure. Our empirical study shows encouraging results of the proposed algorithm in comparison to the state-of-the-art algorithms on real-world problems.

DOI: 10.1109/TPAMI.2010.231

Extracted Key Phrases

5 Figures and Tables

010020020102011201220132014201520162017
Citations per Year

823 Citations

Semantic Scholar estimates that this publication has 823 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Cai2011GraphRN, title={Graph Regularized Nonnegative Matrix Factorization for Data Representation}, author={Deng Cai and Xiaofei He and Jiawei Han and Thomas S. Huang}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, year={2011}, volume={33}, pages={1548-1560} }