Uniqueness of N-way N-mode hierarchical classes models

This paper presents two uniqueness theorems for the family of hierarchical classes models, a collection of order preserving Boolean decomposition models for binary N-way N-mode data. The theorems are compared with uniqueness results for the closely related family of N-way N-mode principal component models. It is concluded that the two-way two-mode PCA and N-way N-mode TuckerN models suffer more from a lack of identifiability than their hierarchical classes analogues, whereas the uniqueness conditions for N-way N-mode PARAFAC/CANDECOMP models are less restrictive than the ones derived for their N-way N-mode hierarchical classes counterparts.