Non-negative graph embedding


We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graphs [17]. In the past, such a decomposition was obtained mostly in an unsupervised manner, such as Non-negative Matrix Factorization (NMF) and its variants, and hence unnecessary to… (More)
DOI: 10.1109/CVPR.2008.4587665


8 Figures and Tables


Citations per Year

116 Citations

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

See our FAQ for additional information.