Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices
- 237 Downloads
A key feature of the analysis of three-way arrays by Candecomp/Parafac is the essential uniqueness of the trilinear decomposition. We examine the uniqueness of the Candecomp/Parafac and Indscal decompositions. In the latter, the array to be decomposed has symmetric slices. We consider the case where two component matrices are randomly sampled from a continuous distribution, and the third component matrix has full column rank. In this context, we obtain almost sure sufficient uniqueness conditions for the Candecomp/Parafac and Indscal models separately, involving only the order of the three-way array and the number of components in the decomposition. Both uniqueness conditions are closer to necessity than the classical uniqueness condition by Kruskal.
KeywordsCandecomp Parafac Indscal three-way arrays uniqueness
Unable to display preview. Download preview PDF.
- Fisher, F.M. (1966). The identification problem in econometrics. New York: McGraw-Hill.Google Scholar
- Harshman, R.A. (1970). Foundations of the Parafac procedure: Models and conditions for an “explanatory“ multimodal factor analysis. UCLA Working Papers in Phonetics, 16, 1–84.Google Scholar
- Harshman, R.A. (1972). Determination and proof of minimum uniqueness conditions for Parafac–1. UCLA Working Papers in Phonetics, 22, 111–117.Google Scholar
- Kruskal, J.B., Harshman, R.A., & Lundy, M.E. (1989). How 3-MFA data can cause degenerate Parafac solutions, among other relationships. In: R. Coppi, & S. Bolasco (Eds.), Multiway data analysis (pp. 115–121). Amsterdam: North-HollandGoogle Scholar
- De Lathauwer, L. (2006). A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization. SIAM Journal of Matrix Analysis and Application, to appear.Google Scholar