Additive conjoint isotonic probabilistic models (ADISOP)

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.     

Items bundles

An item bundle is a small group of multiple choice items that share a common reading passage or graph, or a small group of matching items that share distractors. Item bundles are easily identified by paging through a copy of a test. Bundled items may violate the latent conditional independence assumption of unidimensional item response theory (IRT), but such a violation would not typically suggest the existence of a new fundamental human ability to read one specific reading passage or to interpret one specific graph. It is important, therefore, to have theoretical concepts and empirical checks that distinguish between, on the one hand, anticipated violations of latent conditional independence within item bundles, and, on the other hand, violations that cannot be attributed to idiosyncratic features of test format and instead suggest departures from unidimensionalty. To this end, two theorems on unidimensional IRT are extended to describe observable item response distributions when there is conditional independencebetween but not necessarilywithin item bundles.The author is grateful to Ivo Molenaar and the referees for many helpful suggestions, and to D. Thayer for assistance with computing.     

Methods of time sampling: A reappraisal of momentary time sampling and partial interval recording

We compared the accuracy of momentary time sampling (MTS) and partial interval recording (PIR) in estimating both absolute behavioral levels and relative change. A computer randomly generated runs of pseudobehavior varying in duration and rate and simulated MTS and PIR of each run. Results indicated that when estimating absolute behavioral levels, duration rather than rate should be used as the dependent measure, and MTS is more accurate than PIR. In contrast, PIR is the more sensitive method for detecting relative changes in behavioral levels, although, at high rates, PIR tends to underestimate the degree of change.     

Convergence theory for partial images and revision of the definition of total images

Guttman's assumption underlying his definition of “total images” is rejected: Partial images are not generally convergent everywhere. Even divergence everywhere is shown to be possible. The convergence type always found on partial images is convergence in quadratic mean; hence, total images are redefined as quadratic mean-limits. In determining the convergence type in special situations, the asymptotic properties of certain correlations are important, implying, in some cases, convergence almost everywhere, which is also effected by a countable population or multivariate normality or independent variables. The interpretations of a total image as a predictor, and a “common-factor score”, respectively, are made precise.     

Naming and Diagonalization, from Cantor to Godel to Kleene

We trace self-reference phenomena to the possibility of namingfunctions by names that belong to the domain over which thefunctions are defined. A naming system is a structure of theform (D, type( ),{ }), where D is a non-empty set; for everya D, which is a name of a k-ary function, {a}: D^k D is thefunction named by a, and type(a) is the type of a, which tellsus if a is a name and, if it is, the arity of the named function.Under quite general conditions we get a fixed point theorem,whose special cases include the fixed point theorem underlyingGödel's proof, Kleene's recursion theorem and many othertheorems of this nature, including the solution to simultaneousfixed point equations. Partial functions are accommodated byincluding "undefined" values; we investigate different systemsarising out of different ways of dealing with them. Many-sortednaming systems are suggested as a natural approach to generalcomputatability with many data types over arbitrary structures.The first part of the paper is a historical reconstruction ofthe way Gödel probably derived his proof from Cantor'sdiagonalization, through the semantic version of Richard. Theincompleteness proof–including the fixed point construction–resultfrom a natural line of thought, thereby dispelling the appearanceof a "magic trick". The analysis goes on to show how Kleene'srecursion theorem is obtained along the same lines.     

Decomposition of a Rasch partial credit item into independent binary and indecomposable trinary items

For each Rasch (Masters) partial credit item, there exists a set of independent Rasch binary and indecomposable trinary items for which the sum of the scores and the partial credit score have identical probability density functions. If each indecomposable trinary item is further expressed as the sum of two binary items, then the binary items are positively dependent and cannot be both of the Rasch type. This paper was written while the author was working with Steve Ferrara and Hillary Michaels on some technical aspects of the Maryland School Performance Assessment Program. The author had been puzzled by the fact that most MSPAP assessment items have three or less score categories. With a psychometric justification now being apparent, this paper is dedicated to both of them.     

Rasch models for item bundles

This paper discusses the application of a class of Rasch models to situations where test items are grouped into subsets and the common attributes of items within these subsets brings into question the usual assumption of conditional independence. The models are all expressed as particular cases of the random coefficients multinomial logit model developed by Adams and Wilson. This formulation allows a very flexible approach to the specification of alternative models, and makes model testing particularly straightforward. The use of the models is illustrated using item bundles constructed in the framework of the SOLO taxonomy of Biggs and Collis.The work of both authors was supported by fellowships from the National Academy of Education Spencer Fellowship.     

An Empirical Investigation of Partial Effect Sizes in Meta-Analysis of Correlational Data

ABSTRACT. The partial correlation and the semi-partial correlation can be seen as measures of partial effect sizes for the correlational family. Thus, both indices have been used in the meta-analysis literature to represent the relationship between an outcome and a predictor of interest, controlling for the effect of other variables in the model. This article evaluates the accuracy of synthesizing these two indices under different situations. Both partial correlation and the semi-partial correlation appear to behave as expected with respect to bias and root mean squared error (RMSE). However, the partial correlation seems to outperform the semi-partial correlation regarding Type I error of the homogeneity test (Q statistic). Although further investigation is needed to fully understand the impact of meta-analyzing partial effect sizes, the current study demonstrates the accuracy of both indices.