AN EFFICIENT ALGORITHM FOR PARAFAC OF 3-WAY DATA WITH LARGE NUMBERS OF OBSERVATION UNITS

被引:42
作者
KIERS, HAL
KRIJNEN, WP
机构
[1] Department of Psychology, University of Groningen, Groningen, 9712 TS
关键词
CANDECOMP; PARAFAC;
D O I
10.1007/BF02294592
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The CANDECOMP algorithm for the PARAFAC analysis of n x m x 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.
引用
收藏
页码:147 / 152
页数:6
相关论文
共 7 条
[1]   ANALYSIS OF INDIVIDUAL DIFFERENCES IN MULTIDIMENSIONAL SCALING VIA AN N-WAY GENERALIZATION OF ECKART-YOUNG DECOMPOSITION [J].
CARROLL, JD ;
CHANG, JJ .
PSYCHOMETRIKA, 1970, 35 (03) :283-&
[2]   ORTHOGONAL ROTATION TO CONGRUENCE [J].
CLIFF, N .
PSYCHOMETRIKA, 1966, 31 (01) :33-33
[3]  
Harshman R., 1984, RES METHODS MULTIMOD, P216
[4]  
Harshman R. A., 1970, MULTI MODEL FACTOR A, V16, P1
[5]  
Harshman R.A., 1984, RES METHODS MULTIMOD, P122
[6]  
HARSHMAN RA, 1972, UCLA WORKING PAPERS, V22, P31
[7]  
Kroonenberg P. M., 1983, 3 MODE PRINCIPAL COM