Some new results on orthogonally constrained Candecomp (Q649165)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some new results on orthogonally constrained Candecomp |
scientific article; zbMATH DE number 5982697
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some new results on orthogonally constrained Candecomp |
scientific article; zbMATH DE number 5982697 |
Statements
Some new results on orthogonally constrained Candecomp (English)
0 references
30 November 2011
0 references
Candecomp, developed by \textit{J. D. Carroll} and \textit{J. J. Chang} [Psychometrika 35, 283--319 (1970; Zbl 0202.19101)], is a method to minimize the residual sum of the squares in a scalar problem fitting problem derived from Indscal. In this paper, the authors first describe the Indort algorithm and the simultaneous update of the columns of relevant matrices. Then they present their main result by showing how to combine Indort with non-negative least squares to update saliences. This is followed by a section in which a successive approach, which finds one component at time, and compare its performance with the simultaneous approach.
0 references
simultaneous approach
0 references
successive approach
0 references
indort
0 references
three-way data
0 references
Candecomp
0 references
Indscal
0 references
fitting
0 references
Indort algorithm
0 references
non-negative least squares
0 references
0 references
0 references
0 references
0 references
0.8440926671028137
0 references
0.8038797974586487
0 references
0.7816190719604492
0 references
