Algorithms for Sparse Nonnegative Tucker Decompositions

DOI10.1162/neco.2008.11-06-407zbMath1178.68447WikidataQ28424414 ScholiaQ28424414MaRDI QIDQ3519229

Lars Kai Hansen, Morten Mørup, Sidse Marie Arnfred

Publication date: 13 August 2008

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco.2008.11-06-407

zbMATH Keywords

Tucker model; PARAFAC model; large-scale multiway data

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

Related Items

Nonnegative tensor factorization as an alternative Csiszar-Tusnady procedure: algorithms, convergence, probabilistic interpretations and novel probabilistic tensor latent variable analysis algorithms, Sparse non-negative tensor factorization using columnwise coordinate descent, A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.

Uses Software

• N-way Toolbox

Cites Work

• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Positive tensor factorization
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• A Multilinear Singular Value Decomposition
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution