This paper introduces a new technique for estimating the parameters of models with continuous latent data. Using the Rasch model as an example, it is shown that existing Bayesian techniques for parameter estimation, such as the Gibbs sampler, are not always easy to implement. Then, a new sampling-based Bayesian technique, called the DA-T-Gibbs sampler, is introduced. The DA-T-Gibbs sampler relies on the particular latent data structure of latent response models to simplify the computations involved in parameter estimation.

Transforming the core array in Tucker three-way component analysis to simplicity is an intriguing way of revealing structures in between standard Tucker three-way PCA, where the core array is unconstrained, and CANDECOMP/PARAFAC, where the core array has a generalized diagonal form. For certain classes of arrays, transformations to simplicity, that is, transformations that produce a large number of zeros, can be obtained explicitly by solving sets of linear equations. The present paper extends these results. First, a method is offered to simplifyJ ×J × 2 arrays. Next, it is shown that the transformation that simplifies anI ×J ×K array can be used to also simplify the (complementary) arrays of order (JK −I) ×J ×K, of orderI × (IK −J) ×K and of orderI ×J × (IJ −K). Finally, the question of what constitutes the maximal simplicity for arrays (the maximal number of zero elements) will be considered. It is shown that cases of extreme simplicity, considered in the past, are, in fact, cases of maximal simplicity.

In this paper, we propose a class of locally dependent latent trait models for responses to psychological and educational tests. Typically, item response models treat an individual's multiple response to stimuli as conditional independent given the individual's latent trait. In this paper, instead the focus is on models based on a family of conditional distributions, or kernel, that describes joint multiple item responses as a function of student latent trait, not assuming conditional independence. Specifically, we examine a hybrid kernel which comprises a component for one-way item response functions and a component for conditional associations between items given latent traits. The class of models allows the extension of item response theory to cover some new and innovative applications in psychological and educational research. An EM algorithm for marginal maximum likelihood of the hybrid kernel model is proposed. Furthermore, we delineate the relationship of the class of locally dependent models and the log-linear model by revisiting the Dutch identity (Holland, 1990).

A computerized adaptive test (CAT) is usually administered to small groups of examinees at frequent time intervals. It is often the case that examinees who take the test earlier share information with examinees who will take the test later, thus increasing the risk that many items may become known. Item overlap rate for a group of examinees refers to the number of overlapping items encountered by these examinees divided by the test length. For a specific item pool, different item selection algorithms may yield different item overlap rates. An important issue in designing a good CAT item selection algorithm is to keep item overlap rate below a preset level. In doing so, it is important to investigate what the lowest rate could be for all possible item selection algorithms. In this paper we rigorously prove that if every item has an equal possibility to be selected from the pool in a fixed-length CAT, the number of overlapping items among any α randomly sampled examinees follows the hypergeometric distribution family for α ≥ 1. Thus, the expected values of the number of overlapping items among any randomly sampled α examinees can be calculated precisely. These values may serve as benchmarks in controlling item overlap rates for fixed-length adaptive tests.

One of the basic issues in the analysis of three-way arrays by CANDECOMP/PARAFAC (CP) has been the question of uniqueness of the decomposition. Kruskal (1977) has proved that uniqueness is guaranteed when the sum of thek-ranks of the three component matrices involved is at least twice the rank of the solution plus 2. Since then, little has been achieved that might further qualify Kruskal's sufficient condition. Attempts to prove that it is also necessary for uniqueness (except for rank 1 or 2) have failed, but counterexamples to necessity have not been detected. The present paper gives a method for generating the class of all solutions (or at least a subset of that class), given a CP solution that satisfies certain conditions. This offers the possibility to examine uniqueness for a great variety of specific CP solutions. It will be shown that Kruskal's condition is necessary and sufficient when the rank of the solution is three, but that uniqueness may hold even if the condition is not satisfied, when the rank is four or higher.

In this paper we study the interrelationships between two sets of data measured on the same subjects via redundancy analysis. We consider redundancy analysis from an inferential point of view. Under the hypothesis of multinormality, tests of significance are obtained for each successive redundancy component so that only the significant factors are retained for prediction purposes. An example illustrates the method.

This paper develops diagnostic measures to identify those observations in Thurstonian models for ranking data which unduly influence parameter estimates that are obtained by the partition maximum likelihood approach of Chan and Bentler (1998). Diagnostic measures are constructed by employing the local influence approach that uses geometric techniques to assess the effect of small perturbations on a postulated statistical model. Very little additional effort is required to compute the proposed diagnostic measures, because all of the necessary building blocks are readily available after a usual fit of the model.

Changes in dichotomous data caused by treatments can be analyzed by means of the so-called linear logistic model with relaxed assumptions (LLRA). The LLRA does not require observable criteria representing a single underlying latent trait, but it postulates the generalizability of the treatment effects over criteria and subjects. To test this latter crucial assumption, the mixture LLRA was proposed that allows directly unobservable types of subjects to have different treatment effects. As the earlier methods for estimating the parameters of the mixture LLRA have specific drawbacks, a further method based on the conditional maximum likelihood principle will be presented here. In contrast to the earlier conditional methods, it uses all of the dichotomous change data while having fewer parameters. Further, its goodness-of-fit tests become more sensitive to a falsely specified number of change-types even though the treatment effects are biased. For typically occurring small to moderate sample sizes, however, parametric bootstrapping of the distributions of the fit statistics is recommended for performing hypotheses tests. Finally, three applications of the new method to empirical data are described: first, about the effect of the so-called Trager psychophysical integration, second, about the effect of autogenic therapy on patients with psychosomatic symptoms, and, third, about the effect of religious education on the attitude towards sects.

The seriation of proximity matrices is an important problem in combinatorial data analysis and can be conducted using a variety of objective criteria. Some of the most popular criteria for evaluating an ordering of objects are based on (anti-) Robinson forms, which reflect the pattern of elements within each row and/or column of the reordered matrix when moving away from the main diagonal. This paper presents a branch-and-bound algorithm that can be used to seriate a symmetric dissimilarity matrix by identifying a reordering of rows and columns of the matrix optimizing an anti-Robinson criterion. Computational results are provided for several proximity matrices from the literature using four different anti-Robinson criteria. The results suggest that with respect to computational efficiency, the branch-and-bound algorithm is generally competitive with dynamic programming. Further, because it requires much less storage than dynamic programming, the branch-and-bound algorithm can provide guaranteed optimal solutions for matrices that are too large for dynamic programming implementations.