Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Computing a nonnegative matrix factorization-provably
Sanjeev Arora
, Rong Ge
, Ravi Kannan
, Ankur Moitra
Computer Science
Bendheim Center for Finance
Center for Statistics & Machine Learning
Princeton Language and Intelligence (PLI)
Research output
:
Contribution to journal
›
Article
›
peer-review
48
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Computing a nonnegative matrix factorization-provably'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Matrix (Mathematics)
100%
Factorization
100%
Polynomial Time
44%
Approximates
44%
Probability Theory
11%
Minimizes
11%
Combinatorics
11%
Integer
11%
Frobenius Norm
11%
Singular Value Decomposition
11%
Factorization Problem
11%
Local Search
11%
Past Decade
11%
Computer Science
nonnegative matrix factorization
100%
Polynomial Time
28%
polynomial-time algorithm
28%
Machine Learning
14%
Singular Value
14%
Communication Complexity
14%
Search Heuristic
14%
Keyphrases
Nonnegative Matrix
28%
Approximation Problem
14%