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)

Contrary to Anderson (EJ 187 936), his rule for equation identification is a necessary but not sufficient condition; furthermore, the choice of two-stage or ordinary least squares depends on results and not on methodological properties of estimators. Modification of Anderson's rule and a means for choosing between estimates is offered. (Author/CP)

Canonical analysis of two convex polyhedral cones involves looking for two vectors whose square cosine is a maximum. New results about the properties of the optimal solution to this problem are presented. The convergence of an alternating least squares algorithm and properties of limits of calculated sequences are discussed. (SLD)

An empirical method called Predicted Error Sum of Squares (PRESS) is advanced and studied. This method is used to examine the cross-validated prediction accuracies of some popular algorithms for weighted predictor variables. The weighting methods that were considered were ordinary least squares, ridge regression, regression on principal…