Computing non-negative tensor factorizations
From MaRDI portal
Recommendations
- CAS computation of non-negative tensor factorization
- Algorithms for nonnegative tensor factorization
- Non-negative matrix factorization with sparseness constraints
- Sparse non-negative tensor factorization using columnwise coordinate descent
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- A Multilinear Singular Value Decomposition
- Algorithm 862
- Atomic decomposition by basis pursuit
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Learning the parts of objects by non-negative matrix factorization
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the convergence of the coordinate descent method for convex differentiable minimization
- Positive tensor factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Stable signal recovery from incomplete and inaccurate measurements
- Trust Region Methods
Cited in
(29)- Low rank non-negative triple decomposition and non-negative tensor completion
- Tensor decompositions for count data that leverage stochastic and deterministic optimization
- A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Positive tensor factorization
- An AO-ADMM Approach to Constraining PARAFAC2 on All Modes
- A very brief introduction to nonnegative tensors from the geometric viewpoint
- Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Algorithms for nonnegative tensor factorization
- A reduced Newton method for constrained linear least-squares problems
- LibNMF -- a library for nonnegative matrix factorization
- Variational auto-encoder based Bayesian Poisson tensor factorization for sparse and imbalanced count data
- Randomized algorithms for the low multilinear rank approximations of tensors
- Image representation using Laplacian regularized nonnegative tensor factorization
- Computational experience with numerical methods for nonnegative least-squares problems.
- Fast nonnegative tensor factorizations with tensor train model
- CAS computation of non-negative tensor factorization
- Nonnegative non-redundant tensor decomposition
- Sparse non-negative tensor factorization using columnwise coordinate descent
- Orthogonal nonnegative Tucker decomposition
- On Tensors, Sparsity, and Nonnegative Factorizations
- Best nonnegative rank-one approximations of tensors
- Tensors of nonnegative rank two
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- Factorization strategies for third-order tensors
- Nonnegative Tensor Cofactorization and Its Unified Solution
This page was built for publication: Computing non-negative tensor factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503698)
