Nonnegative tensor factorization as an alternative Csiszar-Tusnady procedure: algorithms, convergence, probabilistic interpretations and novel probabilistic tensor latent variable analysis algorithms
From MaRDI portal
Publication:408627
Recommendations
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations
- Positive tensor factorization
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
Cites work
- scientific article; zbMATH DE number 1232374 (Why is no real title available?)
- A Multilinear Singular Value Decomposition
- Algorithms for Sparse Nonnegative Tucker Decompositions
- Algorithms for nonnegative tensor factorization
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Learning the parts of objects by non-negative matrix factorization
- Nonnegative matrix factorization and I-divergence alternating minimization
- On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Supervised and Semi-supervised Separation of Sounds from Single-Channel Mixtures
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Cited in
(2)
This page was built for publication: Nonnegative tensor factorization as an alternative Csiszar-Tusnady procedure: algorithms, convergence, probabilistic interpretations and novel probabilistic tensor latent variable analysis algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408627)