Miller and Farr's algorithm for the index of redundancy is shown to be incorrect by means of a counterexample. The consequences of this error for other conclusions drawn by the authors are discussed. (Author/JKS)

Latent class analysis is formulated as a problem of estimating parameters in a finite mixture distribution. The EM algorithm is used to find the maximum likelihood estimates, and the case of categorical variables with more than two categories is considered. (Author)

The cross-validated classification accuracies of three predictor weighting strategies (least squares, ridge regression, and reduced rank) were compared under varying simulated data conditions for the two-group classification problem. Results were somewhat similar to previous findings with multiple regression when absolute rather than relative…

This paper shows that redundancy maximization with J. K. Johansson's extension can be accomplished via a simple iterative algorithm based on H. Wold's Partial Least Squares. The model and the iterative algorithm for the least squares approach to redundancy maximization are presented. (TJH)

Issues related to the decision of the number of factors to retain in factor analyses are identified. Three widely used decision rules--the Kaiser-Guttman (eigenvalue greater than one), scree, and likelihood ratio tests--are investigated using simulated data. Recommendations for use are made. (Author/JKS)

The performance of four rules for determining the number of components (factors) to retain (Kaiser's eigenvalue greater than one, Cattell's scree, Bartlett's test, and Velicer's Map) was investigated across four systematically varied factors (sample size, number of variables, number of components, and component saturation). (Author/JKS)