Methods for nonnegative matrix factorization based on low-rank cross approximations

DOI10.1134/S0965542519080165zbMath1426.15018OpenAlexW2976200748MaRDI QIDQ2278210

E. M. Shcherbakova, Evgenij E. Tyrtyshnikov

Publication date: 4 December 2019

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542519080165

zbMATH Keywords

fast algorithmsnonnegative matrix factorizationseparable matricescross approximation methods

Mathematics Subject Classification ID

Related Items (4)

Fast nonnegative tensor factorizations with tensor train model ⋮ Parallel approximation of multidimensional tensors using GPUs ⋮ Adaptive interpolation algorithm using TT-decomposition for modeling dynamical systems with interval parameters ⋮ Nonnegative tensor train factorization with DMRG technique

Uses Software

• TT Toolbox
• GitHub
• HierNMF2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New accuracy estimates for pseudoskeleton approximations of matrices
• Computing symmetric nonnegative rank factorizations
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
• Jensen-Steffensen inequality for strongly convex functions
• On the parameterization of the CreditRisk\(^+\) model for estimating credit portfolio risk
• A theory of pseudoskeleton approximations
• Incomplete cross approximation in the mosaic-skeleton method
• Pseudo-skeleton approximations with better accuracy estimates
• On the Complexity of Nonnegative Matrix Factorization
• A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
• Sparse and Unique Nonnegative Matrix Factorization Through Data Preprocessing
• Computing a nonnegative matrix factorization -- provably

This page was built for publication: Methods for nonnegative matrix factorization based on low-rank cross approximations