scientific article
From MaRDI portal
Publication:2934020
zbMath1319.65023arXiv1309.5701MaRDI QIDQ2934020
Publication date: 8 December 2014
Full work available at URL: https://arxiv.org/abs/1309.5701
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
separabilitynonnegative matrix factorizationrobustness to noisedocument clusteringenclosing ellipsoid
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (7)
Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations ⋮ Enhancing Pure-Pixel Identification Performance via Preconditioning ⋮ Refinement of Hottopixx Method for Nonnegative Matrix Factorization Under Noisy Separability ⋮ Assigning topics to documents by successive projections ⋮ Convex programming based spectral clustering ⋮ Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization ⋮ Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
Uses Software
This page was built for publication:
