The full information item factor (FIIF) model is very useful for analyzing relations of dichotomous variables. In this article, we present a feasible procedure to assess local influence of minor perturbations for identifying influence aspects of the FIIF model. The development is based on a Q-displacement function which is closely related with the Monte Carlo EM algorithm in the ML estimation. In the E-step of this algorithm, the conditional expectations are approximated by sample means of observations simulated by the Gibbs sampler from the appropriate conditional distributions. It turns out that these observations can be utilized for computing the building blocks of the proposed diagnostic measures. The diagnoses are based on the conformal normal curvature that can be computed easily. A number of interesting perturbation schemes are considered. The methodology is illustrated with two real examples.

It is well-known that the representations of the Thurstonian models for difference judgment data are not unique. It has been shown that equivalence classes can be formed to provide a more meaningful partition of the covariance structures of the Thurstonian ranking models. In this paper, we examine the equivalence relations between Thurstonian covariance structure models for paired comparison data obtained under multiple judgment and discuss their implications on the general identification constraints and methods to check for parameter identifiability in restricted models.

This study develops Markov Chain Monte Carlo (MCMC) estimation theory for the General Condorcet Model (GCM), an item response model for dichotomous response data which does not presume the analyst knows the correct answers to the test a priori (answer key). In addition to the answer key, respondent ability, guessing bias, and difficulty parameters are estimated. With respect to data-fit, the study compares between the possible GCM formulations, using MCMC-based methods for model assessment and model selection. Real data applications and a simulation study show that the GCM can accurately reconstruct the answer key from a small number of respondents.

Latent class models in the social and behavioral sciences have remained structurally simple. One reason for this is that inference in statistical models can be computationally difficult. Methods for approximate inference, known as variational approximations, which have been developed in the machine learning, graphical modeling and statistical physics literatures, can be used to alleviate the computational difficulties of inference for latent variable models. The aim of the present article is to set these methods alongside some social and behavioral science literature to which they are relevant, and in particular to consider their potential for “categorical causal modeling”, using latent class analysis. We have collated a number of popular categorical-data models with latent variables and causal structure, typically incorporating a Markovian structure. The efficacy of the approximation methods has been demonstrated through simulations related to an important behavioral science model.

This paper presents a new model for binary three-way three-mode data, called Tucker3 hierarchical classes model (Tucker3-HICLAS). This new model generalizes Leenen, Van Mechelen, De Boeck, and Rosenberg's (1999) individual differences hierarchical classes model (INDCLAS). Like the INDCLAS model, the Tucker3-HICLAS model includes a hierarchical classification of the elements of each mode, and a linking structure among the three hierarchies. Unlike INDCLAS, Tucker3-HICLAS (a) does not restrict the hierarchical classifications of the three modes to have the same rank, and (b) allows for more complex linking structures among the three hierarchies. An algorithm to fit the Tucker3-HICLAS model is described and evaluated in an extensive simulation study. An application of the model to hostility data is discussed.

While negative local item dependence (LID) has been discussed in numerous articles, its occurrence and effects often go unrecognized. This is due in part to confusion over what unidimensional latent trait is being utilized in evaluating the LID of multidimensional testing data. This article addresses this confusion by using an appropriately chosen latent variable to condition on. It then provides a proof that negative LID must occur when unidimensional ability estimates (such as number right score) are obtained from data which follow a very general class of multidimensional item response theory models. The importance of specifying what unidimensional latent trait is used, and its effect on the sign of the LIDs are shown to have implications in regard to a variety of foundational theoretical arguments, to the simulation of LID data sets, and to the use of testlet scoring for removing LID.

Consider the case where J instruments are used to classify each of I objects relative to K nominal categories. The conditional grade-of-membership (GoM) model provides a method of estimating the classification probabilities of each instrument (or “judge”) when the objects being classified consist of both pure types that lie exclusively in one of K nominal categories, and mixtures that lie in more than one category. Classification probabilities are identifiable whenever the sample of GoM vectors includes pure types from each category. When additional, relatively mild, assumptions are made about judgment accuracy, the identifiable correct classification probabilities are the greatest lower bounds among all solutions that might correspond to the observed multinomial process, even when the unobserved GoM vectors do not include pure types from each category. Estimation using the conditional GoM model is illustrated on a simulated data set. Further simulations show that the estimates of the classification probabilities are relatively accurate, even when the sample contains only a small percentage of approximately pure objects.

The aim of this note is to show that the centroid method has two optimality properties. It yields loadings with the highest sum of absolute values, even in absence of the constraint that the squared component weights be equal. In addition, it yields scores with maximum variance, subject to the constraint that none of the squared component weights be larger than 1.