The NMF problem and lattice-subspaces

DOI10.1016/J.LAA.2020.04.020MaRDI QIDQ2185834zbMATH OpenOpenAlexFDO

Authors Ioannis A. Polyrakis

Publication date 5 June 2020

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.05730

zbMATH Keywords

dimension reductionnonnegative matrix factorizationvector latticespositive basessublatticeslattice-subspaces

Mathematics Subject Classification ID

Factorization of matrices (15A23) Ordered topological linear spaces, vector lattices (46A40)

Abstract: Suppose that $A$ is a nonnegative $nimesm$ real matrix. The NMF problem is the determination of two nonnegative real matrices $F$, $V$ so that $A=FV$ with intermediate dimension $p$ smaller than $minn,m$. In this article we present a general mathematical method for the determination of two nonnegative real factors $F,V$ of $A$. During the first steps of this process the intermediate dimension $p$ of $F,V$ is determined, therefore we have an easy criterion for $p$. This study is based on the theory of lattice-subspaces and positive bases. Also we give the matlab program for the computation of $F,V$ but the mathematical part is the main part of this article.

Recommendations

• Nonnegative rank factorization -- a heuristic approach via rank reduction
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• Computing symmetric nonnegative rank factorizations
• On the set of solutions of the nonnegative matrix factorization problem
• Nonnegative matrix factorization

Cites work

• A reverse Hadamard inequality
• Algorithms and applications for approximate nonnegative matrix factorization
• Computation of vector sublattices and minimal lattice-subspaces of \(\mathbb R^k\): applications in finance
• Computing nonnegative rank factorizations
• Computing symmetric nonnegative rank factorizations
• Finite-dimensional lattice-subspaces of 𝐶(Ω) and curves of ℝⁿ
• Heuristics for exact nonnegative matrix factorization
• Minimal lattice-subspaces
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On nonnegative factorization of matrices
• On the geometric interpretation of the nonnegative rank
• SVD based initialization: A head start for nonnegative matrix factorization
• The nonnegative rank of a matrix: hard problems, easy solutions
• The quickhull algorithm for convex hulls

Cited in

(7)

• Nonnegative matrix factorization requires irrationality
• Lattice Identification and Separation: Theory and Algorithm
• On the set of solutions of the nonnegative matrix factorization problem
• Nonnegative rank factorization -- a heuristic approach via rank reduction
• Computing symmetric nonnegative rank factorizations
• scientific article; zbMATH DE number 802815 (Why is no real title available?)
• Positive matrix factorization via extremal polyhedral cones

Describes a project that uses

Uses Software

• Qhull

This page was built for publication: The NMF problem and lattice-subspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185834)