The core of the paper consists of the treatment of two special decompositions for correspondence analysis of two-way ordered contingency tables: the bivariate moment decomposition and the hybrid decomposition, both using orthogonal polynomials rather than the commonly used singular vectors. To this end, we will detail and explain the basic characteristics of a particular set of orthogonal polynomials, called Emerson polynomials. It is shown that such polynomials, when used as bases for the row and/or column spaces, can enhance the interpretations via linear, quadratic and higher-order moments of the ordered categories. To aid such interpretations, we propose a new type of graphical display—the polynomial biplot.

A modification of the TUCKALS3 algorithm is proposed that handles three-way arrays of order I × J × K for any I. When I is much larger than JK, the modified algorithm needs less work space to store the data during the iterative part of the algorithm than does the original algorithm. Because of this and the additional feature that execution speed is higher, the modified algorithm is highly suitable for use on personal computers.

Through external analysis of two-mode data one attempts to map the elements of one mode (e.g., attributes) as vectors in a fixed space of the elements of the other mode (e.g., stimuli). This type of analysis is extended to three-mode data, for instance, when the ratings are made by more individuals. It is described how alternating least squares algorithms for three-mode principal component analysis (PCA) are adapted to enable external analysis, and it is demonstrated that these techniques are useful for exploring differences in the individuals' mappings of the attribute vectors in the fixed stimulus space. Conditions are described under which individual differences may be ignored. External three-mode PCA is illustrated with data from a person perception experiment, designed after two studies by Rosenberg and his associates whose results were used as external information.

Kroonenberg and de Leeuw (1980) have developed an alternating least-squares method TUCKALS-3 as a solution for Tucker's three-way principal components model. The present paper offers some additional features of their method. Starting from a reanalysis of Tucker's problem in terms of a rank-constrained regression problem, it is shown that the fitted sum of squares in TUCKALS-3 can be partitioned according to elements of each mode of the three-way data matrix. An upper bound to the total fitted sum of squares is derived. Finally, a special case of TUCKALS-3 is related to the Carroll/Harshman CANDECOMP/PARAFAC model.

A new method to estimate the parameters of Tucker’s three-mode principal component model is discussed, and the convergence properties of the alternating least squares algorithm to solve the estimation problem are considered. A special case of the general Tucker model, in which the principal component analysis is only performed over two of the three modes is briefly outlined as well. The Miller & Nicely data on the confusion of English consonants are used to illustrate the programs TUCKALS3 and TUCKALS2 which incorporate the algorithms for the two models described.

In this paper correspondence analysis for three-way contingency tables is presented using three-way generalisations of the singular value decomposition. It is shown that in combination with Lancaster's (1951) additive decomposition of interactions in three-way tables, a detailed analysis is possible of the deviations from independence. Finally, biplots are shown to produce powerful graphical representations of the results from three-way correspondence analyses. An example from child development is used to illustrate the theoretical developments.