In this paper, it is shown that various violations of the 2-PL model and the nominal response model can be evaluated using the Lagrange multiplier test or the equivalent efficient score test. The tests presented here focus on violation of local stochastic independence and insufficient capture of the form of the item characteristic curves. Primarily, the tests are item-oriented diagnostic tools, but taken together, they also serve the purpose of evaluation of global model fit. A useful feature of Lagrange multiplier statistics is that they are evaluated using maximum likelihood estimates of the null-model only, that is, the parameters of alternative models need not be estimated. As numerical examples, an application to real data and some power studies are presented.

The ISOP-model or model of twodimensional or bi-isotonicity (Scheiblechner, 1995) postulates that the probabilities of ordered response categories increase isotonically in the order of subject “ability” and item ”easiness”. Adding a conventional cancellation axiom for the factors of subjects and items gives the ADISOP model where the c.d.f.s of response categories are functions of an additive item and subject parameter and an ordinal category parameter. Extending cancellation to the interactions of subjects and categories as well as of items and categories (independence axiom of the category factor from the subject and item factor) gives the CADISOP model (completely additive model) in which the parallel c.d.f.s are functions of the sum of subject, item and category parameters. The CADISOP model is very close to the unidimensional version of the polytomous Rasch model with the logistic item/category characteristic(s) replaced by nonparametric axioms and statistics. The axioms, representation theorems and algorithms for model fitting of the additive models are presented.

When r Principal Components are available for k variables, the correlation matrix is approximated in the least squares sense by the loading matrix times its transpose. The approximation is generally not perfect unless r =k. In the present paper it is shown that, when r is at or above the Ledermann bound, r principal components are enough to perfectly reconstruct the correlation matrix, albeit in a way more involved than taking the loading matrix times its transpose. In certain cases just below the Ledermann bound, recovery of the correlation matrix is still possible when the set of all eigenvalues of the correlation matrix is available as additional information.

Although Thurstonian models provide an attractive representation of choice behavior, they have not been extensively used in ranking applications since only recently efficient estimation methods for these models have been developed. These, however, require the use of special-purpose estimation programs, which limits their applicability. Here we introduce a formulation of Thurstonian ranking models that turns an idiosyncratic estimation problem into an estimation problem involving mean and covariance structures with dichotomous indicators. Well-known standard solutions for the latter can be readily applied to this specific problem, and as a result any Thurstonian model for ranking data can be fitted using existing general purpose software for mean and covariance structure analysis. Although the most popular programs for covariance structure analysis (e.g., LISREL and EQS) cannot be presently used to estimate Thurstonian ranking models, other programs such as MECOSA already exist that can be straightforwardly used to estimate these models.

A highly popular method for examining the stability of a data clustering is to split the data into two parts, cluster the observations in Part A, assign the objects in Part B to their nearest centroid in Part A, and then independently cluster the Part B objects. One then examines how close the two partitions are (say, by the Rand measure). Another proposal is to split the data into k parts, and see how their centroids cluster. By means of synthetic data analyses, we demonstrate that these approaches fail to identify the appropriate number of clusters, particularly as sample size becomes large and the variables exhibit higher correlations.

When the underlying distribution is discrete with a limited number of categories, methods for interval estimation of the intraclass correlation which assume normality are theoretically inadequate for use. On the basis of large sample theory, this paper develops an asymptotic closed-form interval estimate of the intraclass correlation for the case where there is a natural score associated with each category. This paper employs Monte Carlo simulation to demonstrate that when the underlying intraclass correlation is large, the traditional interval estimator which assumes normality can be misleading. We find that when the number of classes is ≥ 20, the interval estimator proposed here can generally perform reasonably well in a variety of situations. This paper further notes that the proposed interval estimator is invariant with respect to a linear transformation. When the data are on a nominal scale, an extension of the proposed method to account for this case, as well as a discussion on the relationship between the intraclass correlation and a kappa-type measure defined here and on the limitation of the corresponding kappa-type estimator are given.

This paper generalizes the p* model for dichotomous social network data (Wasserman & Pattison, 1996) to the polytomous case. The generalization is achieved by transforming valued social networks into three-way binary arrays. This data transformation requires a modification of the Hammersley-Clifford theorem that underpins the p* class of models. We demonstrate that, provided that certain (non-observed) data patterns are excluded from consideration, a suitable version of the theorem can be developed. We also show that the approach amounts to a model for multiple logits derived from a pseudo-likelihood function. Estimation within this model is analogous to the separate fitting of multinomial baseline logits, except that the Hammersley-Clifford theorem requires the equating of certain parameters across logits. The paper describes how to convert a valued network into a data array suitable for fitting the model and provides some illustrative empirical examples.