The interactive learning is a continuous process, which is full of a large number of learning interaction activities. The data generated between learners and learning interaction activities can reflect the online learning behaviors. Through the correlation analysis among learning interaction activities, this paper discusses the potential…

It is shown that Bayesian algorithms are computationally simpler in frequency formats than in the probability formats used in previous research. Analysis of several thousand solutions to Bayesian problems showed that when information was presented in frequency formats, statistically naive participants derived up to 50% of inferences by Bayesian…

Generalizing Boolean matrix decomposition to a larger class of matrix decomposition models is demonstrated, and probability matrix decomposition (PMD) models are introduced as a probabilistic version of the larger class. An algorithm is presented for the computation of maximum likelihood and maximum a posteriori estimates of the parameters of PMD…

A nonmetric algorithm, pairwise partitioning, is developed to identify feature-based similarity structures. Presents theorems about the validity of the features identified by the algorithm, and reports results of Monte Carlo simulations that estimate the probabilities of identifying valid features for different feature structures and amounts of…

The ability of the NORMIX algorithm to recover overlapping population structures was compared to the OVERCLUS procedure and another clustering procedure in a Monte Carlo study. NORMIX is found to be more accurate than other procedures in recovering overlapping population structure when appropriate implementation options are specified. (SLD)

A probabilistic choice model, based on L. L. Thurstone's Law of Comparative Judgment Case V, is developed for paired comparisons data about psychological stimuli. The model assumes that each stimulus is measured on a small number of physical variables. An algorithm for estimating parameters is illustrated with real data. (SLD)

A model is presented for item responses when different subjects use different strategies, but only responses--not choice of strategy--can be observed. Substantive theory is used to differentiate the likelihoods of response vectors under a fixed set of strategies, and response probabilities are modeled via item parameters for each strategy. (TJH)

An extension is proposed for the network algorithm introduced by C.R. Mehta and N.R. Patel to construct exact tail probabilities for testing the general hypothesis that item responses are distributed according to the Rasch model. A simulation study indicates the efficiency of the algorithm. (SLD)

A probabilistic item response theory (IRT) model is developed for pair-comparison design in which the unfolding principle governing the choice process uses a discriminant process analogous to Thurstone's Law of Comparative Judgment. A simulation study demonstrates the feasibility of estimation, and two examples illustrate the implications for…

This article gives a comprehensive description of a theory for efficient assessment of knowledge. The essential concept is that the knowledge state of a subject, with regard to a specified field of information, can be represented by a particular subset of problems that the subject is capable of solving. (SLD)