Skip to main content
Conference Proceedings

Global minimization of the projective nonnegative matrix factorization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5507 LNCS(PART 2) 987-993
DOI: 10.1007/978-3-642-03040-6_120
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Nonnegative Matrix Factorization (NMF) is a widely used method in approximating high dimensional data. All the NMF type methods find only the local minimizers. In this paper, we use filled function method to find the global minimizer of the Projective Nonnegative Matrix Factorization optimal problem. © 2009 Springer Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Yuan, Z. (2009). Global minimization of the projective nonnegative matrix factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5507 LNCS, pp. 987–993). https://doi.org/10.1007/978-3-642-03040-6_120

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free