Probability matrix decomposition models

In this paper, we consider a class of models for two-way matrices with binary entries of 0 and 1. First, we considerBoolean matrix decomposition, conceptualize it as alatent response model (LRM) and, by making use of this conceptualization, generalize it to a larger class of matrix decomposition models. Second,probability matrix decomposition (PMD) models are introduced as a probabilistic version of this larger class of deterministic matrix decomposition models. Third, an algorithm for the computation of the maximum likelihood (ML) and the maximum a posteriori (MAP) estimates of the parameters of PMD models is presented. This algorithm is an EM-algorithm, and is a special case of a more general algorithm that can be used for the whole class of LRMs. And fourth, as an example, a PMD model is applied to data on decision making in psychiatric diagnosis. This paper is based on a chapter of the first author's doctoral dissertation, written at the University of Leuven and supervised by Paul De Boeck.     

Undermatching on concurrent variable-interval schedules and the power law.

The phenomenon of undermatching on concurrent variable-interval schedules is shown to be derivable by transforming the individual interreinforcement intervals of each variable-interval schedule and averaging the transformed values to produce an "estimate" of the rate of reinforcement the schedules deliver. If the transformation is based on a power function with a fractional exponent, such as is found in many studies of temporal control in animals, matching response rations to the ratios of these estimated rates of reinforcement yields undermatching. If the concurrent variable-interval schedules are arranged such that the individual intervals in each schedule have a constant proportionality (a procedure found in many commonly used variable-interval schedules) the slope of the line relating logarithms of response ratios and of programmed reinforcement ratios is identical to the exponent of the power transformation applied to the individual time intervals in the variable-interval schedules. In other cases this simple relation does not hold but the degree of undermatching is greater the lower the value of the exponent of the power function. This account of undermatching predicts values similar to those typically observed.     

Linear structural equations with latent variables

An interdependent multivariate linear relations model based on manifest, measured variables as well as unmeasured and unmeasurable latent variables is developed. The latent variables include primary or residual common factors of any order as well as unique factors. The model has a simpler parametric structure than previous models, but it is designed to accommodate a wider range of applications via its structural equations, mean structure, covariance structure, and constraints on parameters. The parameters of the model may be estimated by gradient and quasi-Newton methods, or a Gauss-Newton algorithm that obtains least-squares, generalized least-squares, or maximum likelihood estimates. Large sample standard errors and goodness of fit tests are provided. The approach is illustrated by a test theory model and a longitudinal study of intelligence.This investigation was supported in part by a Research Scientist Development Award (KO2-DA00017) and a research grant (DA01070) from the U. S. Public Health Service.     

Constrained multidimensional scaling inN spaces

A gradient method is used to obtain least squares estimates of parameters of them-dimensional euclidean model simultaneously inN spaces, given the observation of all pairwise distances ofn stimuli for each space. The procedure can estimate an additive constant as well as stimulus projections and the metric of the reference axes of the configuration in each space. Each parameter in the model can be fixed to equal some a priori value, constrained to be equal to any other parameter, or free to take on any value in the parameter space. Two applications of the procedure are described.     

Marginal maximum likelihood estimation of item parameters: Application of an EM algorithm

Maximum likelihood estimation of item parameters in the marginal distribution, integrating over the distribution of ability, becomes practical when computing procedures based on an EM algorithm are used. By characterizing the ability distribution empirically, arbitrary assumptions about its form are avoided. The Em procedure is shown to apply to general item-response models lacking simple sufficient statistics for ability. This includes models with more than one latent dimension.Supported in part by NSF grant BNS 7912417 to the University of Chicago and by SSRC (UK) grant HR6132 to the University of Lancaster.We are indebted to Mark Reiser and Robert Gibbons for computer programming. David Thissen clarified a number of points in an earlier draft.     

On the existence and uniqueness of maximum-likelihood estimates in the Rasch model

Necessary and sufficient conditions for the existence and uniqueness of a solution of the so-called unconditional (UML) and the conditional (CML) maximum-likelihood estimation equations in the dichotomous Rasch model are given. The basic critical condition is essentially the same for UML and CML estimation. For complete data matricesA, it is formulated both as a structural property ofA and in terms of the sufficient marginal sums. In case of incomplete data, the condition is equivalent to complete connectedness of a certain directed graph. It is shown how to apply the results in practical uses of the Rasch model.Paper read at the European Meeting of the Psychometric Society, Groningen, June 19–21, 1980.Part of the research reported herein was done while the author was staying at the Pulmologisches Zentrum der Stadt Wien; he is indebted to Professor Dr. F. Muhar and Dr. R. Mutschlechner for providing excellent working conditions.     

Statistical evaluation of measures of fit in the Lingoes-Borg procrustean individual differences scaling

PINDIS, as recently presented by Lingoes and Borg [1978] not only marks the latest development within the scope of individual differences scaling, but, may be of benefit in some closely related topics, such as target analysis. Decisions on whether the various models available from PINDIS fit fallible data are relatively arbitrary, however, since a statistical theory of the fit measures is lacking. Using Monte Carlo simulation, expected fit measures as well as some related statistics were therefore obtained by scaling sets of 4(4)24 random configurations of 5(5)30 objects in 2, 3, and 4 dimensions (individual differences case) and by fitting one random configuration to a fixed random target for 5(5)30 objects in 2, 3, and 4 dimensions (target analysis case). Applications are presented.     

A bayesian alternative to least squares and equal weighting coefficients in regression

This paper details a Bayesian alternative to the use of least squares and equal weighting coefficients in regression. An equal weight prior distribution for the linear regression parameters is described with regard to the conditional normal regression model, and resulting posterior distributions for these parameters are detailed. Some interesting connections between this Bayesian procedure and several other methods for estimating optimal weighting coefficients are discussed. In addition, results are presented of a Monte Carlo investigation which compared the effectiveness of the Bayesian procedure relative to least squares, equal weight, ridge, and Bayesian exchangeability estimations.     

Logit models and logistic regressions for social networks: III. Valued relations

This paper generalizes thep* 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 thep* 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.This research was supported by grants from the Australian Research Council, the National Science Foundation (#SBR96-30754), and the National Institute of Health (#PHS-1RO1-39829-01).     

Some critical observations of the test information function as a measure of local accuracy in ability estimation

The test information function serves important roles in latent trait models and in their applications. Among others, it has been used as the measure of accuracy in ability estimation. A question arises, however, if the test information function is accurate enough for all meaningful levels of ability relative to the test, especially when the number of test items is relatively small (e.g., less than 50). In the present paper, using the constant information model and constant amounts of test information for a finite interval of ability, simulated data were produced for eight different levels of ability and for twenty different numbers of test items ranging between 10 and 200. Analyses of these data suggest that it is desirable to consider some modification of the test information function when it is used as the measure of accuracy in ability estimation.