An efficient algorithm for PARAFAC of three-way data with large numbers of observation units

Henk A.L. Kiers, Wim P. Krijnen

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

The CANDECOMP algorithm for the PARAFAC analysis of n × m × p three-way arrays is adapted to handle arrays in which n > rnp more efficiently. For such arrays, the adapted algorithm needs less memory space to store the data during the iterations, and uses less com- putation time than the original CANDECOMP algorithm. The size of the arrays that can be handled by the new algorithm is in no way limited by the number of observation units (n) in the data.
Original languageEnglish
Pages (from-to)147-152
JournalPsychometrika. Vol 67(1)
Volume56
Issue number1
DOIs
Publication statusPublished - Mar 1991

Keywords

  • CANDECOMP
  • PARAFAC

Fingerprint Dive into the research topics of 'An efficient algorithm for PARAFAC of three-way data with large numbers of observation units'. Together they form a unique fingerprint.

Cite this