Positive tensor factorization
From MaRDI portal
Publication:2748199
DOI10.1016/S0167-8655(01)00070-8zbMath0990.68123OpenAlexW2073502026WikidataQ29396836 ScholiaQ29396836MaRDI QIDQ2748199
Publication date: 14 October 2001
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8655(01)00070-8
Related Items
Stochastic Gradients for Large-Scale Tensor Decomposition ⋮ Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations ⋮ Nonnegative matrix factorization and its applications in pattern recognition ⋮ Variational auto-encoder based Bayesian Poisson tensor factorization for sparse and imbalanced count data ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ Tensor SOM and tensor GTM: nonlinear tensor analysis by topographic mappings ⋮ Nonnegative low rank tensor approximations with multidimensional image applications ⋮ Data decomposition using independent component analysis with prior constraints. ⋮ Non-negative low-rank approximations for multi-dimensional arrays on statistical manifold ⋮ Algorithms for Sparse Nonnegative Tucker Decompositions ⋮ Sparse non-negative tensor factorization using columnwise coordinate descent ⋮ Facial expression recognition based on discriminant neighborhood preserving nonnegative tensor factorization and ELM ⋮ Multilayer tensor factorization with applications to recommender systems ⋮ About advances in tensor data denoising methods ⋮ Image representation using Laplacian regularized nonnegative tensor factorization ⋮ Numerical method for the generalized nonnegative tensor factorization problem ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework ⋮ Generalized Canonical Polyadic Tensor Decomposition ⋮ Low-Rank Approximation and Completion of Positive Tensors ⋮ Computing non-negative tensor factorizations
