Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms

Authors:
Lieven De Lathauwer;Dimitri Nion
Affiliations:
Lieven.DeLathauwer@kuleuven-kortrijk.be;nion@telecom.tuc.gr
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2008

Citing 0
Cited 9

Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar

IEEE Transactions on Signal Processing
Application of reductive decomposition method for multilinear arrays (RDMMA) to animations

MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Extended HALS algorithm for nonnegative Tucker decomposition and its applications for multiway analysis and classification

Neurocomputing
Block component analysis, a new concept for blind source separation

LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
A combination of parallel factor and independent component analysis

Signal Processing
Maximum Block Improvement and Polynomial Optimization

SIAM Journal on Optimization
Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms

SIAM Journal on Matrix Analysis and Applications
Utilizing common substructures to speedup tensor factorization for mining dynamic graphs

Proceedings of the 21st ACM international conference on Information and knowledge management
Multifactor sparse feature extraction using Convolutive Nonnegative Tucker Decomposition

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we derive alternating least squares algorithms for the computation of the block term decompositions introduced in Part II. We show that degeneracy can also occur for block term decompositions.