Transforming the core array in Tucker three-way component analysis to simplicity is an intriguing way of revealing structures in between standard Tucker three-way PCA, where the core array is unconstrained, and CANDECOMP/PARAFAC, where the core array has a generalized diagonal form. For certain classes of arrays, transformations to simplicity, that is, transformations that produce a large number of zeros, can be obtained explicitly by solving sets of linear equations. The present paper extends these results. First, a method is offered to simplify J × J × 2 arrays. Next, it is shown that the transformation that simplifies an I × J × K array can be used to also simplify the (complementary) arrays of order (JK - I) × J × K, of order 1 >:. (1K - J) × K and of order I × J × (IJ - K). Finally, the question of what constitutes the maximal simplicity for arrays (the maximal number of zero elements) will be considered. It is shown that cases of extreme simplicity, considered in the past, are, in fact, cases of maximal simplicity.
Transforming three-way arrays to maximal simplicity / Rocci, R; TEN BERGE, J. M. F.. - In: PSYCHOMETRIKA. - ISSN 0033-3123. - 67:(2002), pp. 351-365.
Transforming three-way arrays to maximal simplicity
ROCCI R;
2002
Abstract
Transforming the core array in Tucker three-way component analysis to simplicity is an intriguing way of revealing structures in between standard Tucker three-way PCA, where the core array is unconstrained, and CANDECOMP/PARAFAC, where the core array has a generalized diagonal form. For certain classes of arrays, transformations to simplicity, that is, transformations that produce a large number of zeros, can be obtained explicitly by solving sets of linear equations. The present paper extends these results. First, a method is offered to simplify J × J × 2 arrays. Next, it is shown that the transformation that simplifies an I × J × K array can be used to also simplify the (complementary) arrays of order (JK - I) × J × K, of order 1 >:. (1K - J) × K and of order I × J × (IJ - K). Finally, the question of what constitutes the maximal simplicity for arrays (the maximal number of zero elements) will be considered. It is shown that cases of extreme simplicity, considered in the past, are, in fact, cases of maximal simplicity.File | Dimensione | Formato | |
---|---|---|---|
Rocco_transforming-three-way_2002.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
860.66 kB
Formato
Unknown
|
860.66 kB | Unknown | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.