Sample size determinations for the two rater kappa statistic

This paper gives a method for determining a sample size that will achieve a prespecified bound on confidence interval width for the interrater agreement measure,. The same results can be used when a prespecified power is desired for testing hypotheses about the value of kappa. An example from the literature is used to illustrate the methods proposed here.     

Discriminability between alternatives in a switching-key concurrent schedule

Six pigeons were trained to discriminate between two intensities of white light in a symbolic matching-to-sample procedure. These stimuli were then used to signal which schedule was available on the main key in a switching-key concurrent schedule. The concurrent schedules led to a symbolic matching-to-sample phase in which the subject identified the concurrent schedule to which it last responded before a reinforcer could be obtained. The concurrent schedules were varied across conditions. Discriminability, measured during the symbolic matching-to-sample performance, was high throughout and did not differ across the two procedures. Performance in the concurrent schedules was like that typically obtained using these schedules. Delays were then arranged between completion of the concurrent schedules and presentations of the symbolic matching-to-sample phase. A series of conditions with an intervening delay of 10 s showed that both concurrent-schedule performance and symbolic matching-to-sample performance were affected by the delay in a similar way; that is, choice responding was closer to indifference.     

Imputation of missing categorical data by maximizing internal consistency

This paper suggests a method to supplant missing categorical data by reasonable replacements. These replacements will maximize the consistency of the completed data as measured by Guttman's squared correlation ratio. The text outlines a solution of the optimization problem, describes relationships with the relevant psychometric theory, and studies some properties of the method in detail. The main result is that the average correlation should be at least 0.50 before the method becomes practical. At that point, the technique gives reasonable results up to 10–15% missing data.We thank Anneke Bloemhoff of NIPG-TNO for compiling and making the Dutch Life Style Survey data available to use, and Chantal Houée and Thérèse Bardaine, IUT, Vannes, France, exchange students under the COMETT program of the EC, for computational assistance. We also thank Donald Rubin, the Editors and several anonymous reviewers for constructive suggestions.     

Constructing the exact significance level for a person fit statistic

This paper uses an extension of the network algorithm originally introduced by Mehta and Patel to construct exact tail probabilities for testing the general hypothesis that item responses are distributed according to the Rasch model. By assuming that item difficulties are known, the algorithm is applicable to the statistical tests either given the maximum likelihood ability estimate or conditioned on the total score. A simulation study indicates that the network algorithm is an efficient tool for computing the significance level of a person fit statistic based on test lengths of 30 items or less.     

A quasi-nonmetric method for multidimensional scaling VIA an extended euclidean model

An Extended Two-Way Euclidean Multidimensional Scaling (MDS) model which assumes both common and specific dimensions is described and contrasted with the standard (Two-Way) MDS model. In this Extended Two-Way Euclidean model then stimuli (or other objects) are assumed to be characterized by coordinates onR common dimensions. In addition each stimulus is assumed to have a dimension (or dimensions) specific to it alone. The overall distance between objecti and objectj then is defined as the square root of the ordinary squared Euclidean distance plus terms denoting the specificity of each object. The specificity,s _j , can be thought of as the sum of squares of coordinates on those dimensions specific to objecti, all of which have nonzero coordinatesonly for objecti. (In practice, we may think of there being just one such specific dimension for each object, as this situation is mathematically indistinguishable from the case in which there are more than one.)We further assume that _ij =F(d _ij ) +e _ij where _ij is the proximity value (e.g., similarity or dissimilarity) of objectsi andj,d _ij is the extended Euclidean distance defined above, whilee _ij is an error term assumed i.i.d.N(0, ²).F is assumed either a linear function (in the metric case) or a monotone spline of specified form (in the quasi-nonmetric case). A numerical procedure alternating a modified Newton-Raphson algorithm with an algorithm for fitting an optimal monotone spline (or linear function) is used to secure maximum likelihood estimates of the paramstatistics) can be used to test hypotheses about the number of common dimensions, and/or the existence of specific (in addition toR common) dimensions.This approach is illustrated with applications to both artificial data and real data on judged similarity of nations.     

Incorporating prior theory in covariance structure analysis: A bayesian approach

A Bayesian approach to the testing of competing covariance structures is developed. The method provides approximate posterior probablities for each model under consideration without prior specification of individual parameter distributions. The method is based on ayesian updating using cross-validated pseudo-likelihoods. Given that the observed variables are the samefor all competing models, the approximate posterior probabilities may be obtained easily from the chi square values and other known constants, using only a hand calculator. The approach is illustrated using and example which illustrates how the prior probabilities can alter the results concerning which model specification is preferred.     

Algorithmic shaping and misbehavior in the acquisition of token deposit by rats

In two experiments, rats were trained to deposit ball bearings down a hole in the floor, using an algorithmic version of shaping. The experimenter coded responses expected to be precursors of the target response, ball bearing deposit; a computer program reinforced these responses, or not, according to an algorithm that mimicked the processes thought to occur in conventional shaping. In the first experiment, 8 of 10 rats were successfully shaped; in the second, 5 of 5 were successfully shaped, and the median number of sessions required was the same as for a control group trained using conventional shaping. In both experiments, “misbehavior,” that is, excessive handling and chewing of the ball bearings, was observed, and when the algorithmic shaping procedure was used, misbehavior could be shown to occur in spite of reduced reinforcement for the responses involved.     

Nonconvergence,improper solutions,and starting values in lisrel maximum likelihood estimation

In the framework of a robustness study on maximum likelihood estimation with LISREL three types of problems are dealt with: nonconvergence, improper solutions, and choice of starting values. The purpose of the paper is to illustrate why and to what extent these problems are of importance for users of LISREL. The ways in which these issues may affect the design and conclusions of robustness research is also discussed.     

Statistical consistency and hypothesis testing for nonmetric multidimensional scaling

The properties of nonmetric multidimensional scaling (NMDS) are explored by specifying statistical models, proving statistical consistency, and developing hypothesis testing procedures. Statistical models with errors in the dependent and independent variables are described for quantitative and qualitative data. For these models, statistical consistency often depends crucially upon how error enters the model and how data are collected and summarized (e.g., by means, medians, or rank statistics). A maximum likelihood estimator for NMDS is developed, and its relationship to the standard Shepard-Kruskal estimation method is described. This maximum likelihood framework is used to develop a method for testing the overall fit of the model.     

On structural equation modeling with data that are not missing completely at random

A general latent variable model is given which includes the specification of a missing data mechanism. This framework allows for an elucidating discussion of existing general multivariate theory bearing on maximum likelihood estimation with missing data. Here, missing completely at random is not a prerequisite for unbiased estimation in large samples, as when using the traditional listwise or pairwise present data approaches. The theory is connected with old and new results in the area of selection and factorial invariance. It is pointed out that in many applications, maximum likelihood estimation with missing data may be carried out by existing structural equation modeling software, such as LISREL and LISCOMP. Several sets of artifical data are generated within the general model framework. The proposed estimator is compared to the two traditional ones and found superior.The research of the first author was supported by grant No. SES-8312583 from the National Science Foundation and by a Spencer Foundation grant. We wish to thank Chuen-Rong Chan for drawing the path diagram.