Tensor Decompositions and Applications
- 6 August 2009
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 51 (3), 455-500
- https://doi.org/10.1137/07070111x
Abstract
This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or N-way array. Decompositions of higher-order tensors (i.e., N-way arrays with N ≥ 3) have applications in psycho-metrics, chemometrics, signal processing, numerical linear algebra, computer vision, nu-merical analysis, data mining, neuroscience, graph analysis, and elsewhere. Two particular tensor decompositions can be considered to be higher-order extensions of the matrix sin-gular value decomposition: CANDECOMP/PARAFAC (CP) decomposes a tensor as a sum of rank-one tensors, and the Tucker decomposition is a higher-order form of principal component analysis. There are many other tensor decompositions, including INDSCAL, PARAFAC2, CANDELINC, DEDICOM, and PARATUCK2 as well as nonnegative vari-ants of all of the above. The N-way Toolbox, Tensor Toolbox, and Multilinear Engine are examples of software packages for working with tensors. Key words. tensor decompositions, multiway arrays, multilinear algebra, parallel factors (PARAFAC), canonical decomposition (CANDECOMP), higher-order principal components analysis (Tucker), higher-order singular value decomposition (HOSVD) AMS subject classifications. 15A69, 65F99 DOI. 10.1137/07070111Keywords
This publication has 100 references indexed in Scilit:
- Degeneracy in Candecomp/Parafac and Indscal Explained For Several Three-Sliced Arrays With A Two-Valued Typical RankPsychometrika, 2007
- Handwritten digit classification using higher order singular value decompositionPattern Recognition, 2007
- Eigenvalues of a real supersymmetric tensorJournal of Symbolic Computation, 2005
- Existence and Computation of Low Kronecker-Rank Approximations for Large Linear Systems of Tensor Product StructureComputing, 2004
- Application of the three‐way decomposition for matrix compressionNumerical Linear Algebra with Applications, 2002
- Positive tensor factorizationPattern Recognition Letters, 2001
- An index formalism that generalizes the capabilities of matrix notation and algebra to n‐way arraysJournal of Chemometrics, 2001
- Three-way component analysis: Principles and illustrative application.Psychological Methods, 2001
- Tensor rank is NP-completeJournal of Algorithms, 1990
- O(n2.7799) complexity for n × n approximate matrix multiplicationInformation Processing Letters, 1979