A split-sample replication stopping rule for hierarchical cluster analysis is compared with the internal criterion previously found superior by Milligan and Cooper (1985) in their comparison of 30 different procedures. The number and extent of overlap of the latent population distributions was systematically varied in the present evaluation of stopping-rule validity. Equal and unequal population base rates were also considered. Both stopping rules correctly identified the actual number of populations when there was essentially no overlap and clusters occupied visually distinct regions of the measurement space. The replication criterion, which is evaluated by clustering of cluster means from preliminary analyses that are accomplished on random partitions of an original data set, was superior as the degree of overlap in population distributions increased. Neither method performed adequately when overlap obliterated visually discernible density nodes.

In a recent article, Fagot proposed a generalized family of coefficients of relational agreement for multiple judges, focusing on the concept of empirically meaningful relationships. In this paper an ordinal coefficient of relational agreement, based on ranking data, is presented as a special case of the generalized family. It is shown that the proposed ordinal coefficient encompasses other ordinal coefficients, such as the Kendall coefficient of concordance, the average Spearman rank-order coefficient, and intraclass correlation based on ranks. It is also shown that the Kendall coefficient of concordance, corrected for chance agreement, is equivalent to the ordinal coefficient proposed in this paper.

Procedures for oblique rotation of factors or principal components typically focus on rotating the pattern matrix such that it becomes optimally simple. An important oblique rotation method that does so is Harris and Kaiser's (1964) independent cluster (HKIC) rotation. In principal components analysis, a case can be made for interpreting the components on the basis of the component weights rather than on the basis of the pattern, so it seems desirable to rotate the components such that the weights rather than the pattern become optimally simple. In the present paper, it is shown that HKIC rotates the components such that both the pattern and the weights matrix become optimally simple. In addition, it is shown that the pattern resulting from HKIC rotation is columnwise proportional to the associated weights matrix, which implies that the interpretation of the components does not depend on whether it is based on the pattern or on the component weights matrix. It is also shown that the latter result only holds for HKIC rotation and slight modifications of it.

A general theory for parametric inference in contingency tables is outlined. Estimation of polychoric correlations is seen as a special case of this theory. The asymptotic covariance matrix of the estimated polychoric correlations is derived for the case when the thresholds are estimated from the univariate marginals and the polychoric correlations are estimated from the bivariate marginals for given thresholds. Computational aspects are also discussed.

The use of p-values in combining the results of independent studies often involves studies that are potentially aberrant either in quality or in actual values. A robust data analysis suggests the use of a statistic that takes these aberrations into account by trimming some of the largest and smallest p-values. We present a trimmed statistic based on an inverse cumulative normal transformation of the ordered p-values, together with a simple and convenient method for approximating the distribution and first two moments of this statistic.

A model for preferential and triadic choice is derived in terms of weighted sums of central F distribution functions. This model is a probabilistic generalization of Coombs' (1964) unfolding model and special cases, such as the model of Zinnes and Griggs (1974), can be derived easily from it. This new form extends previous work by Mullen and Ennis (1991) and provides more insight into the same problem that they discussed.

The item response function (IRF) for a polytomously scored item is defined as a weighted sum of the item category response functions (ICRF, the probability of getting a particular score for a randomly sampled examinee of ability θ). This paper establishes the correspondence between an IRF and a unique set of ICRFs for two of the most commonly used polytomous IRT models (the partial credit models and the graded response model). Specifically, a proof of the following assertion is provided for these models: If two items have the same IRF, then they must have the same number of categories; moreover, they must consist of the same ICRFs. As a corollary, for the Rasch dichotomous model, if two tests have the same test characteristic function (TCF), then they must have the same number of items. Moreover, for each item in one of the tests, an item in the other test with an identical IRF must exist. Theoretical as well as practical implications of these results are discussed.

With random assignment to treatments and standard assumptions, either a one-way ANOVA of post-test scores or a two-way, repeated measures ANOVA of pre- and post-test scores provides a legitimate test of the equal treatment effect null hypothesis for latent variable Θ. In an ANCOVA for pre- and post-test variables X and Y which are ordinal measures of η and Θ, respectively, random assignment and standard assumptions ensure the legitimacy of inferences about the equality of treatment effects on latent variable Θ. Sample estimates of adjusted Y treatment means are ordinal estimators of adjusted post-test means on latent variable Θ.

Hierarchical Bayes procedures for the two-parameter logistic item response model were compared for estimating item and ability parameters. Simulated data sets were analyzed via two joint and two marginal Bayesian estimation procedures. The marginal Bayesian estimation procedures yielded consistently smaller root mean square differences than the joint Bayesian estimation procedures for item and ability estimates. As the sample size and test length increased, the four Bayes procedures yielded essentially the same result.

De Vries (1993) discusses Pearson's product-moment correlation, Spearman's rank correlation, and Kendall's rank-correlation coefficient for assessing the association between the rows of two proximity matrices. For each of these he introduces a weighted average variant and a rowwise variant. In this note it is shown that for all three types, the absolute value of the first variant is greater than or equal to the absolute value of the second.

A well-known result is that the usual correlation coefficient, ρ, is highly nonrobust: very slight changes in only one of the marginal distributions can alter ρ by a substantial amount. There are a variety of methods for correcting this problem. This paper identifies one particular method which is useful in psychometrics and provides a simple test for independence. It is not recommended that the new test replace the usual test of H0: ρ = 0, but the new test has important advantages over the usual test in terms of both Type I errors and power.

Many-one mappings between stimulus properties and pairwise generated similarities are intrinsic to definitions of similarity. This of itself is not sufficient as a basis for predicting the variance associated with any single similarity judgment. An extension to cover this has to be made either by making ancillary assumptions about noise, or by using nonlinear models. The derivation of the variance of similarity judgments is made from the 3Γ process in nonlinear psychophysics. The idea of separability of dimensions in metric space theories of similarity is replaced by one parameter which represents the degree of a form of interdimensional crosscoupling

Given a Masters partial credit item with n known step difficulties, conditions are stated for the existence of a set of (locally) independent Rasch binary items such that their raw score and the partial credit raw score have identical probability density functions. The conditions are those for the existence of n positive values with predetermined elementary symmetric functions and include the requirement that the n step difficulties form an increasing sequence.

This paper presents some results on identification in multitrait-multimethod (MTMM) confirmatory factor analysis (CFA) models. Some MTMM models are not identified when the (factorial-patterned) loadings matrix is of deficient column rank. For at least one other MTMM model, identification does exist despite such deficiency. It is also shown that for some MTMM CFA models, Howe's (1955) conditions sufficient for rotational uniqueness can fail, yet the model may well be identified and rotationally unique. Implications of these results for CFA models in general are discussed.