Computing a nonnegative matrix factorization -- provably
From MaRDI portal
Recommendations
Cites work
- 10.1162/jmlr.2003.3.4-5.993
- A new decision method for elementary algebra
- An almost optimal algorithm for computing nonnegative rank
- Communication complexity and combinatorial lattice theory
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Computing a nonnegative matrix factorization -- provably
- Expressing combinatorial optimization problems by linear programs
- Extended formulations for polygons
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Learning the parts of objects by non-negative matrix factorization
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- On the combinatorial and algebraic complexity of quantifier elimination
- On the complexity of k-SAT
- On the complexity of nonnegative matrix factorization
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the number of separable partitions
- On the possibility of faster \textsc{SAT} algorithms
- Separable partitions
- Solving systems of polynomial inequalities in subexponential time
- The number of partitions of a set of N points in k dimensions induced by hyperplanes
Cited in
(28)- A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence
- Exact solutions in low-rank approximation with zeros
- Heuristics for exact nonnegative matrix factorization
- Ellipsoidal rounding for nonnegative matrix factorization under noisy separability
- Exact and heuristic algorithms for semi-nonnegative matrix factorization
- On the complexity of nonnegative matrix factorization
- Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
- On rationality of nonnegative matrix factorization
- On restricted nonnegative matrix factorization
- Computing approximate PSD factorizations
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms
- Provably robust blind source separation of linear-quadratic near-separable mixtures
- Topic Models and Nonnegative Matrix Factorization
- Extension complexity of low-dimensional polytopes
- Nonnegative matrix factorization via archetypal analysis
- Nonnegative matrix factorization requires irrationality
- Computing a nonnegative matrix factorization -- provably
- An almost optimal algorithm for computing nonnegative rank
- An almost optimal algorithm for computing nonnegative rank
- A sampling algorithm to compute the set of feasible solutions for nonnegative matrix factorization with an arbitrary rank
- Partial Identifiability for Nonnegative Matrix Factorization
- Coseparable Nonnegative Matrix Factorization
- Nonnegative matrix factorization with local similarity learning
- Conic optimization-based algorithms for nonnegative matrix factorization
- Robust machine learning algorithms for text analysis
- Multivariate to bivariate reduction for noncommutative polynomial factorization
- Near-linear time and fixed-parameter tractable algorithms for tensor decompositions
- Structured nonnegative matrix factorization with applications to hidden Markov realization and clustering
This page was built for publication: Computing a nonnegative matrix factorization -- provably
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817794)
