Pages that link to "Item:Q5415472"
From MaRDI portal
The following pages link to Computing a nonnegative matrix factorization -- provably (Q5415472):
Displaying 50 items.
- Analyzing Raman spectral data without separabiliy assumption (Q115286) (← links)
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem (Q254874) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Common information and unique disjointness (Q343843) (← links)
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Tropical lower bounds for extended formulations (Q745680) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
- Convex nonnegative matrix factorization with manifold regularization (Q889387) (← links)
- A very brief introduction to nonnegative tensors from the geometric viewpoint (Q1634685) (← links)
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
- DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling (Q1675578) (← links)
- Multiscale blind source separation (Q1750285) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- Factoring a band matrix over a semiring (Q2041261) (← links)
- Convex programming based spectral clustering (Q2051294) (← links)
- Minimal positive realizations: A survey (Q2158979) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Robust subspace clustering (Q2249846) (← links)
- Methods for nonnegative matrix factorization based on low-rank cross approximations (Q2278210) (← links)
- An operator theoretic approach to nonparametric mixture models (Q2328057) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Enhanced matrix power function for cryptographic primitive construction (Q2415047) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Non-negative matrix factorization under equality constraints -- a study of industrial source identification (Q2509899) (← links)
- SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding (Q2512905) (← links)
- Trace Refinement in Labelled Markov Decision Processes (Q2811347) (← links)
- Computing a Nonnegative Matrix Factorization---Provably (Q2817794) (← links)
- Enhancing Pure-Pixel Identification Performance via Preconditioning (Q3192648) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- (Q4558493) (← links)
- Matrices of Bounded Psd Rank are Easy to Detect (Q4577739) (← links)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774) (← links)
- Toward Quantifying Vertex Similarity in Networks (Q4985357) (← links)
- Non-Negative Sparse Regression and Column Subset Selection with L1 Error (Q4993270) (← links)
- Recovering Structured Probability Matrices (Q4993314) (← links)
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (Q4999395) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- Provably Robust Blind Source Separation of Linear-Quadratic Near-Separable Mixtures (Q5024389) (← links)
- Multilinear Compressive Sensing and an Application to Convolutional Linear Networks (Q5025785) (← links)
- Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets (Q5073629) (← links)
- Refinement of Hottopixx Method for Nonnegative Matrix Factorization Under Noisy Separability (Q5094208) (← links)
- Nonnegative Matrix Factorization Via Archetypal Analysis (Q5130630) (← links)
- (Q5214176) (← links)
- Low Permutation-rank Matrices: Structural Properties and Noisy Completion (Q5214186) (← links)
- (Q5214187) (← links)
- Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization (Q5252582) (← links)
- The Complexity of Positive Semidefinite Matrix Factorization (Q5355204) (← links)