Similarity data can be represented by additive trees. In this model, objects are represented by the external nodes of a tree, and the dissimilarity between objects is the length of the path joining them. The additive tree is less restrictive than the ultrametric tree, commonly known as the hierarchical clustering scheme. The two representations are characterized and compared. A computer program, ADDTREE, for the construction of additive trees is described and applied to several sets of data. A comparison of these results to the results of multidimensional scaling illustrates some empirical and theoretical advantages of tree representations over spatial representations of proximity data.

Estimates of the mean and standard deviation of the tetrachoric correlation are compared with their expected values in several 2 × 2 tables. Significant bias in the mean is found when the minimum cell frequency is less than 5. Three formulas for the standard deviation are compared and guidelines given for their use.

Under consideration is a test battery of binary items. The responses of n individuals are assumed to follow a Rasch model. It is further assumed that the latent individual parameters are distributed within a given population in accordance with a normal distribution. Methods are then considered for estimating the mean and variance of this latent population distribution. Also considered are methods for checking whether a normal population distribution fits the data. The developed methods are applied to data from an achievement test and from an attitude test.

Measures of consistency and completeness of order relations derived from test-type data are proposed. The measures are generalized to apply to incomplete data such as from tailored testing. The measures are based on consideration of the items-plus-persons by items-plus-persons matrix as an adjacency matrix in which a 1 means that the row element, whether item or person, dominated the column element. From this the number of item-item and person-person dominance relations can be derived. Indices of consistency are developed which compare the number of dominance relations in a matrix to the number that would occur if it were perfectly consistent and to the number in a random matrix; relations to other indices are noted.

A Monte Carlo study was carried out to investigate the ability of ALSCAL to recover true structure inherent in simulated proximity measures. The nature of the simulated data varied according to (a) number of stimuli, (b) number of individuals, (c) number of dimensions, and (d) level of random error. Four aspects of recovery were studied: (a) SSTRESS, (b) recovery of true distances, (c) recovery of stimulus dimensions, and (d) recovery of individual weights. Results indicated that all four measures were rather strongly affected by random error. Also, SSTRESS improved with fewer stimuli in more dimensions, but the other three indices behaved in the opposite fashion. Most importantly, it was found that the number of individuals, over the range studied, did not have a substantial effect on any of the four measures of recovery. Practical implications and suggestions for further research are discussed.

Three different software programs which contain hierarchical agglomerative cluster analysis procedures were shown to generate different solutions on the same data set using apparently the same options. The basis for the differences in the solutions was the formulae used to calculate Euclidean distance. Users of statistical software were warned of terminological confusion concerning cluster analysis.

A two-step weighted least squares estimator for multiple factor analysis of dichotomized variables is discussed. The estimator is based on the first and second order joint probabilities. Asymptotic standard errors and a model test are obtained by applying the Jackknife procedure.

Kaiser presented a method for finding a set of derived orthogonal variables which correlate maximally with a set of original variables. A simpler, more complete derivation of Kaiser's result is given and compared to related types of transformations. The transformation derived here suggests a direct method for finding the orthogonal factor solution which is maximally similar to a given oblique solution.

Parameter estimation for Keats generalization of the Rasch model that takes account of guessing behavior is investigated. It is shown that no minimal sufficient statistics for the ability parameters independent of the difficulty parameters exist. Thus Andersen's conditional inference technique for consistent estimation is not applicable to Keats' model. The notion of separability of the parameters is generalized.

This paper presents a simple random procedure for selecting subsets of stimulus pairs for presentation to subjects. The resulting set of ratings from the group of subjects allows the construction of a group (average) space through the use of the computer program TORSCA-9 or equivalent programs. The procedure is applied to both real and simulated data. It is found that subjects need only make between 20% and 50% of the usual judgements to reconstruct a reasonably accurate group space.