Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
DOI10.1007/s10915-020-01233-wzbMath1442.15021OpenAlexW3033021868WikidataQ114225614 ScholiaQ114225614MaRDI QIDQ2189661
Publication date: 16 June 2020
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-020-01233-w
Euclidean distancegeneralized KL divergencemultiplicative updating rulesymmetric nonnegative tensor factorizationsymmetric nonnegative Tucker decomposition
Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs
- A semidefinite algorithm for completely positive tensor decomposition
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Numerical optimization for symmetric tensor decomposition
- Infinite and finite dimensional Hilbert tensors
- Eigenvalues of a real supersymmetric tensor
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations
- Algorithms for Sparse Nonnegative Tucker Decompositions
- Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis
- Numerical Optimization
- A Multilinear Singular Value Decomposition
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
- Nesterov-Based Alternating Optimization for Nonnegative Tensor Factorization: Algorithm and Parallel Implementation
- On Tensors, Sparsity, and Nonnegative Factorizations
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- Learning the parts of objects by non-negative matrix factorization
- Nonnegative tensors revisited: plane stochastic tensors
- Independent Component Analysis and Blind Signal Separation
This page was built for publication: Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications