Candecomp/Parafac with zero constraints at arbitrary positions in a loading matrix

When one interprets Candecomp/Parafac (CP) solutions for analyzing three-way data, small loadings are often ignored, that is, considered to be zero. Rather than just considering them zero, it seems better to actually model such values as zero. This can be done by successive modeling approaches as well as by a simultaneous modeling approach. This paper offers algorithms for three such approaches, and compares them on the basis of empirical data and a simulation study. The conclusion of the latter was that, under realistic circumstances, all approaches recovered the underlying structure well, when the number of values to constrain to zero was given. Whereas the simultaneous modeling approach seemed to perform slightly better, differences were very small and not substantial. Given that the simultaneous approach is far more time consuming than the successive approaches, the present study suggests that for practical purposes successive approaches for modeling zeros in the CP model seem to be indicated.