Sparse and Unique Nonnegative Matrix Factorization Through Data Preprocessing
From MaRDI portal
Publication:5405228
zbMath1436.15013arXiv1204.2436MaRDI QIDQ5405228
Publication date: 1 April 2014
Full work available at URL: https://arxiv.org/abs/1204.2436
Analysis of algorithms and problem complexity (68Q25) Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (19)
Nonnegative Matrix Factorization Requires Irrationality ⋮ Low Permutation-rank Matrices: Structural Properties and Noisy Completion ⋮ Heuristics for exact nonnegative matrix factorization ⋮ Common information and unique disjointness ⋮ A survey on deep matrix factorizations ⋮ Refinement of Hottopixx Method for Nonnegative Matrix Factorization Under Noisy Separability ⋮ Nonnegative decomposition of functional count data ⋮ Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares ⋮ A Blind Source Separation Technique for Document Restoration ⋮ Issues of stability and uniqueness of stochastic matrix factorization ⋮ Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory ⋮ Methods for nonnegative matrix factorization based on low-rank cross approximations ⋮ SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding ⋮ Lower bounds on nonnegative rank via nonnegative nuclear norms ⋮ Orthogonal joint sparse NMF for microarray data analysis ⋮ Unnamed Item ⋮ Multiple linear regression models for random intervals: a set arithmetic approach ⋮ Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization ⋮ Provably Robust Blind Source Separation of Linear-Quadratic Near-Separable Mixtures
This page was built for publication: Sparse and Unique Nonnegative Matrix Factorization Through Data Preprocessing
