Fast nonnegative tensor factorizations with tensor train model
From MaRDI portal
Recommendations
Cites work
- Algorithm 862
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
- Error Preserving Correction: A Method for CP Decomposition at a Target Error Bound
- Methods for nonnegative matrix factorization based on low-rank cross approximations
- Nonnegative tensor train factorization with DMRG technique
- Tensor conjugate-gradient-type method for Rayleigh quotient minimization in block QTT-format
- Tensor-train decomposition
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- TT-cross approximation for multidimensional arrays
Cited in
(9)- Nonnegative tensor train factorization with DMRG technique
- Tensor representation of non-linear models using cross approximations
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Tensor Train Neighborhood Preserving Embedding
- Study of performance of low-rank nonnegative tensor factorization methods
- Quasi-orthogonalization for alternating non-negative tensor factorization
- Nonnegative tensor train for the multicomponent Smoluchowski equation
- Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors
- Fast computation of eigenvector centralities for multilayer networks with nonnegative tensor train
This page was built for publication: Fast nonnegative tensor factorizations with tensor train model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674997)