TOPICS
Search

Tucker Decomposition


The Tucker decomposition expresses a tensor by a core tensor and a factor matrix along each index (Kolda and Bader 2009). For an order-N tensor, it has the form

 X=G×_1A^((1))×_2A^((2))...×_NA^((N)),

where ×_n denotes multiplication along index n. An exact decomposition uses equality. If X has size I_1×...×I_N, the core G has size R_1×...×R_N and A^((n)) has size I_n×R_n.

Taking R_n<I_n gives compression and dimensionality reduction. The factor matrices are often chosen to have columns that form an orthonormal set. This makes the decomposition a higher-order analog of principal component analysis. Unlike the CANDECOMP/PARAFAC decomposition, the core allows interactions among distinct components along different indices.


See also

CANDECOMP/PARAFAC Decomposition, Dimensionality Reduction, Multiway Data, Principal Component Analysis, Tensor Decomposition

Explore with Wolfram|Alpha

References

Kolda, T. G. and Bader, B. W. "Tensor Decompositions and Applications." SIAM Rev. 51, 455-500, 2009. https://doi.org/10.1137/07070111X.

Cite this as:

Weisstein, Eric W. "Tucker Decomposition." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TuckerDecomposition.html

Subject classifications