Nonnegative tensor factorization as an alternative Csiszar-Tusnady procedure: algorithms, convergence, probabilistic interpretations and novel probabilistic tensor latent variable analysis algorithms
DOI10.1007/s10618-010-0196-4zbMath1235.65041OpenAlexW2129455341MaRDI QIDQ408627
Maria Petrou, Stefanos P. Zafeiriou
Publication date: 11 April 2012
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-010-0196-4
Kullback-Leibler divergencenonnegative matrix factorizationnonnegative tensor factorizationprobabilistic latent semantic analysis
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05) Convergence of probability measures (60B10)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Nonnegative matrix factorization and I-divergence alternating minimization
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Algorithms for Sparse Nonnegative Tucker Decompositions
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Supervised and Semi-supervised Separation of Sounds from Single-Channel Mixtures
- Algorithms for Nonnegative Tensor Factorization
- A Multilinear Singular Value Decomposition
- Learning the parts of objects by non-negative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
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