PARAFAC: Parallel factor analysis. We review the method of Parallel Factor Analysis, which simultaneously fits multiple two-way arrays or ‘slices’ of a three-way array in terms of a common set of factors with differing relative weights in each ‘slice’. Mathematically, it is a straightforward generalization of the bilinear model of factor (or component) analysis (xij = ΣRr = 1airbjr) to a trilinear model (xijk = ΣRr = 1airbjrckr). Despite this simplicity, it has an important property not possessed by the two-way model: if the latent factors show adequately distinct patterns of three-way variation, the model is fully identified; the orientation of factors is uniquely determined by minimizing residual error, eliminating the need for a separate ‘rotation’ phase of analysis. The model can be used several ways. It can be directly fit to a three-way array of observations with (possibly incomplete) factorial structure, or it can be indirectly fit to the original observations by fitting a set of covariance matrices computed from the observations, with each matrix corresponding to a two-way subset of the data. Even more generally, one can simultaneously analyze covariance matrices computed from different samples, perhaps corresponding to different treatment groups, different kinds of cases, data from different studies, etc. To demonstrate the method we analyze data from an experiment on right vs. left cerebral hemispheric control of the hands during various tasks. The factors found appear to correspond to the causal influences manipulated in the experiment, revealing their patterns of influence in all three ways of the data. Several generalizations of the parallel factor analysis model are currently under development, including ones that combine parallel factors with Tucker-like factor ‘interactions’. Of key importance is the need to increase the method’s robustness against nonstationary factor structures and qualitative (nonproportional) factor change.

References in zbMATH (referenced in 12 articles , 1 standard article )

Showing results 1 to 12 of 12.
Sorted by year (citations)

  1. Domanov, Ignat; De Lathauwer, Lieven: Generic uniqueness conditions for the canonical polyadic decomposition and INDSCAL (2015)
  2. Bordes, Antoine; Glorot, Xavier; Weston, Jason; Bengio, Yoshua: A semantic matching energy function for learning with multi-relational data (2014)
  3. Domanov, Ignat; De Lathauwer, Lieven: Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition (2014)
  4. Karfoul, Ahmad; Albera, Laurent; De Lathauwer, Lieven: Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification (2011)
  5. Brachat, Jerome; Comon, Pierre; Mourrain, Bernard; Tsigaridas, Elias: Symmetric tensor decomposition (2010)
  6. Derado, Gordana; Bowman, F.DuBois; Ely, Timothy D.; Kilts, Clinton D.: Evaluating functional autocorrelation within spatially distributed neural processing networks (2010)
  7. Badeau, Roland; Boyer, Rémy: Fast multilinear singular value decomposition for structured tensors (2008)
  8. De Lathauwer, Lieven; De Moor, Bart; Vandewalle, Joos: Computation of the canonical decomposition by means of a simultaneous generalized Schur decomposition (2004)
  9. Zhang, Tong; Golub, Gene H.: Rank-one approximation to high order tensors (2001)
  10. Harshman, Richard A.; Lundy, Margaret E.: Uniqueness proof for a family of models sharing features of Tucker’s three-mode factor analysis and PARAFAC/CANDECOMP (1996)
  11. Harshman, R.A.; Lundy, M.E.: PARAFAC: Parallel factor analysis (1994)
  12. Kroonenberg, P.M.: The TUCKALS line. A suite of programs for three-way data analysis (1994)