Correlation matrices involving linear dependencies are common in educational research. In such matrices, there is no unique solution for the multiple regression coefficients. Although computer programs using iterative techniques are used to overcome this problem, these techniques possess certain disadvantages. Accordingly, a modified Gauss-Jordan…

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…

A new algorithm is used to test and describe the set of all possible solutions for any linear model of an empirical ordering derived from techniques such as additive conjoint measurement, unfolding theory, general Fechnerian scaling, and ordinal multiple regression. The algorithm is computationally faster and numerically superior to previous…

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)

This description of the technical details required for using the HIER-GRP computer program, which was developed to group or cluster regression equations in an iterative manner so as to minimize the overall loss of predictive efficiency at each iteration, contains a discussion of the basic algorithm, an outline of the essential steps,…

Stochastic approximation algorithms for least square error approximation to density and distribution functions are considered. The main results are necessary and sufficient parameter conditions for the convergence of the approximation processes and a generalization to some time-dependent density and distribution functions. (Author)

This paper offers a new methodology for analyzing individual differences in preference judgments with regard to a set of stimuli. (Author)

This paper presents the results of three experiments studying routine problem-solving tasks in simple addition and subtraction. Indications are that children tend to solve such problems by internalized counting procedures which may be learned independently as a consequence of practice in problem solving. Brief descriptions of exploratory studies…

The absence of suitable external criteria is a recurrent problem for test, battery, and inventory developers in selecting items or tests for inclusion in final operational instruments. This report presents a computing algorithm developed for use when no adequate external selection criterion is available. The algorithm uses a multiple linear…

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…

The results of an algorithm which is designed to take a set of commonality coefficients, either real or manipulated, and, if possible, produce one or more sets of regressor correlations that are consistent with them are examined. A number of different ways of resolving the higher order commonality values into their lower orders were tried and the…

Proposes a quadratic programming, least squares solution to Carroll's weighted unfolding model with nonnegativity constraints imposed on weights. It can be used to test various hypotheses about the weighted unfolding model with or without constraints. (RC)