Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T22:22:54.631Z Has data issue: false hasContentIssue false

An Efficient Algorithm for PARAFAC of Three-Way Data with Large Numbers of Observation Units

Published online by Cambridge University Press:  01 January 2025

Henk A. L. Kiers*
Affiliation:
University of Groningen
Wim P. Krijnen
Affiliation:
University of Groningen
*
Requests for reprints should be sent to Henk A. L. Kiers, Department of Psychology, University of Groningen, Grote Kruisstraat 2/1, 9712 TS Groningen, THE NETHERLANDS.

Abstract

The CANDECOMP algorithm for the PARAFAC analysis of n × m × p three-way arrays is adapted to handle arrays in which n > mp more efficiently. For such arrays, the adapted algorithm needs less memory space to store the data during the iterations, and uses less computation 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.

Information

Type
Computational Psychometrics
Copyright
Copyright © 1991 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable