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

Henk A.L. Kiers; Wim P. Krijnen

doi:10.1007/bf02294592

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

Henk A.L. Kiers, Wim P. Krijnen

Statistical Techniques for Applied Research

University of Groningen, Department of Psychology

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	147-152
Journal	Psychometrika. Vol 67(1)
Volume	56
Issue number	1
DOIs	https://doi.org/10.1007/bf02294592
Publication status	Published - Mar 1991

Keywords

CANDECOMP
PARAFAC

Research Focus Areas Hanze University of Applied Sciences * (mandatory by Hanze)

Healthy Ageing

Research Focus Areas Research Centre or Centre of Expertise * (mandatory by Hanze)

Frailty and adequate care

Publinova themes

Other
Health

Access to Document

10.1007/bf02294592

Cite this

@article{ef4bc1c401b74526a71d6a6887d18495,

title = "An efficient algorithm for PARAFAC of three-way data with large numbers of observation units",

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.",

keywords = "CANDECOMP, PARAFAC",

author = "Kiers, {Henk A.L.} and Krijnen, {Wim P.}",

year = "1991",

month = mar,

doi = "10.1007/bf02294592",

language = "English",

volume = "56",

pages = "147--152",

journal = "Psychometrika. Vol 67(1)",

issn = "0033-3123",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

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

AU - Kiers, Henk A.L.

AU - Krijnen, Wim P.

PY - 1991/3

Y1 - 1991/3

N2 - 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.

AB - 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.

KW - CANDECOMP

KW - PARAFAC

U2 - 10.1007/bf02294592

DO - 10.1007/bf02294592

M3 - Article

SN - 0033-3123

VL - 56

SP - 147

EP - 152

JO - Psychometrika. Vol 67(1)

JF - Psychometrika. Vol 67(1)

IS - 1

ER -

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

Abstract

Keywords

Research Focus Areas Hanze University of Applied Sciences * (mandatory by Hanze)

Research Focus Areas Research Centre or Centre of Expertise * (mandatory by Hanze)

Publinova themes

Access to Document

Fingerprint

Cite this