Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation

DOI10.1109/TSP.2012.2190410MaRDI QIDQ4573806zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Guoxu Zhou, Andrzej Cichocki, Shengli Xie

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2012.2190410

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35)

Cited in

(28)

• A very brief introduction to nonnegative tensors from the geometric viewpoint
• Enhanced image approximation using shifted rank-1 reconstruction
• Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
• Characterization of sampling patterns for low-tt-rank tensor retrieval
• Randomized algorithms for the low multilinear rank approximations of tensors
• Nonnegative tensor train factorization with DMRG technique
• Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
• A unified statistical approach to non-negative matrix factorization and probabilistic latent semantic indexing
• A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions
• Nonnegative low rank tensor approximations with multidimensional image applications
• Nonnegative Tensor Train Factorizations and Some Applications
• Block kernel nonnegative matrix factorization for face recognition
• Accelerating block coordinate descent for nonnegative tensor factorization
• Robust low-rank tensor factorization by cyclic weighted median
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
• A quasi-likelihood approach to nonnegative matrix factorization
• Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines
• Study of performance of low-rank nonnegative tensor factorization methods
• Non-negative low-rank approximations for multi-dimensional arrays on statistical manifold
• Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
• Online subspace learning and imputation by tensor-ring decomposition
• Quasi-orthogonalization for alternating non-negative tensor factorization
• Efficient algorithms for Tucker decomposition via approximate matrix multiplication
• Randomized algorithms for symmetric nonnegative matrix factorization
• Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition
• Intrinsic Low-Tucker-Rank Theory and Unified Tensor CUR Decomposition for High-Dimensional Hyperinterpolation
• Mixed-precision fully-connected tensor network decomposition

This page was built for publication: Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation

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