Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
From MaRDI portal
Publication:3630364
DOI10.1137/070680436zbMath1168.65019OpenAlexW2053479878MaRDI QIDQ3630364
Publication date: 28 May 2009
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f5624a85f3b8b81bdb08d242764399c623405ca0
Hahn-Banach theoremnumerical examplesnumerical algorithmnonnegative matrix factorizationsupporting hyperplanepolytope approximationprobability simplex
Related Items (10)
Rank functions of tropical matrices ⋮ A very brief introduction to nonnegative tensors from the geometric viewpoint ⋮ DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling ⋮ Integer matrix approximation and data mining ⋮ Nonnegative rank factorization -- a heuristic approach via rank reduction ⋮ On the geometric interpretation of the nonnegative rank ⋮ On the nonnegative rank of Euclidean distance matrices ⋮ Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing ⋮ Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework ⋮ Unnamed Item
This page was built for publication: Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization