Article ID Journal Published Year Pages File Type
416350 Computational Statistics & Data Analysis 2006 11 Pages PDF
Abstract

A key feature of the analysis of three-way arrays by Candecomp/Parafac is the essential uniqueness of the trilinear decomposition. Kruskal has previously shown that the three component matrices involved are essentially unique when the sum of their k  -ranks is at least twice the rank of the decomposition plus 2. It was proved that Kruskal's sufficient condition is also necessary when the rank of the decomposition is 2 or 3. If the rank is 4 or higher, the condition is not necessary for uniqueness. However, when the kk-ranks of the component matrices equal their ranks, necessity of Kruskal's condition still holds in the rank-4 case. Ten Berge and Sidiropoulos conjectured that Kruskal's condition is necessary for all cases of rank 4 and higher where ranks and k-ranks coincide. In the present paper we show that this conjecture is false.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,