Transforming three-way arrays to maximal simplicity

DOI10.1007/BF02294989zbMath1297.62136MaRDI QIDQ463112

Jos M. F. ten Berge, Roberto Rocci

Publication date: 15 October 2014

Published in: Psychometrika (Search for Journal in Brave)

zbMATH Keywords

simplicity; tensor decomposition; CANDECOMP/PARAFAC; core array; three-way PCA; Tucker-3

Mathematics Subject Classification ID

62H25: Factor analysis and principal components; correspondence analysis

15A69: Multilinear algebra, tensor calculus

15A99: Basic linear algebra

Related Items

Simplicity and typical rank results for three-way arrays, Symmetry transformations for square sliced three-way arrays, with applications to their typical rank, The Carroll and Chang conjecture of equal Indscal components when Candecomp/Parafac gives perfect fit, Simplicity transformations for three-way arrays with symmetric slices, and applications to Tucker-3 models with sparse core arrays

Cites Work

• Simplicity of core arrays in three-way principal component analysis and the typical rank of \(p\times q\times 2\) arrays
• Principal component analysis of three-mode data by means of alternating least squares algorithms
• Kruskal's polynomial for \(2 \times{}2 \times{}2\) arrays and a generalization to \(2 \times{}n \times{}n\) arrays
• Three-way SIMPLIMAX for oblique rotation of the three-mode factor analysis core to simple structure.
• Uniqueness of three-mode factor models with sparse cores: The \(3\times 3\times 3\) case
• A case of extreme simplicity of the core matrix in three-mode principal components analysis
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition