NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 9 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Lonneke Boels; Enrique Garcia Moreno-Esteva; Arthur Bakker; Paul Drijvers – International Journal of Artificial Intelligence in Education, 2024
As a first step toward automatic feedback based on students' strategies for solving histogram tasks we investigated how strategy recognition can be automated based on students' gazes. A previous study showed how students' task-specific strategies can be inferred from their gazes. The research question addressed in the present article is how data…
Descriptors: Eye Movements, Learning Strategies, Problem Solving, Automation
Peer reviewed Peer reviewed
Rindskopf, David – Psychometrika, 1992
A general approach is described for the analysis of categorical data when there are missing values on one or more observed variables. The method is based on generalized linear models with composite links. Situations in which the model can be used are described. (SLD)
Descriptors: Algorithms, Classification, Data Analysis, Estimation (Mathematics)
Peer reviewed Peer reviewed
Zielman, Berrie; Heiser, Willem J. – Psychometrika, 1993
An algorithm based on the majorization theory of J. de Leeuw and W. J. Heiser is presented for fitting the slide-vector model. It views the model as a constrained version of the unfolding model. A three-way variant is proposed, and two examples from market structure analysis are presented. (SLD)
Descriptors: Algorithms, Classification, Equations (Mathematics), Estimation (Mathematics)
Peer reviewed Peer reviewed
Macready, George B.; Dayton, C. Mitchell – Psychometrika, 1992
An adaptive testing algorithm is presented based on an alternative modeling framework, and its effectiveness is investigated in a simulation based on real data. The algorithm uses a latent class modeling framework in which assessed latent attributes are assumed to be categorical variables. (SLD)
Descriptors: Adaptive Testing, Algorithms, Bayesian Statistics, Classification
Peer reviewed Peer reviewed
Schweizer, Karl – Multivariate Behavioral Research, 1991
A mathematical formula is introduced for the effect of integrating data. A method is then derived to eliminate the effect from correlations of variables, including mean composites, thus allowing for a clustering algorithm that requires allocation of variables according to the magnitude of their correlations. Examples illustrate the procedure. (SLD)
Descriptors: Algorithms, Classification, Cluster Analysis, Computer Simulation
Tatsuoka, Kikumi K. – 1991
Diagnosing cognitive errors possessed by examinees can be considered as a pattern classification problem that is designed to classify a sequential input of stimuli into one of several predetermined groups. The sequential inputs in this paper's context are item responses, and the predetermined groups are various states of knowledge resulting from…
Descriptors: Algorithms, Classification, Cognitive Processes, Equations (Mathematics)
Peer reviewed Peer reviewed
Bockenholt, Ulf; Bockenholt, Ingo – Psychometrika, 1991
A reparameterization of a latent class model is presented to classify and scale nomial and ordered categorical choice data simultaneously. The model extension represents a nonhomogeneous population as a mixture of homogeneous subpopulations. Simulated data and data from a magazine preference survey of 347 college students illustrate the model.…
Descriptors: Algorithms, Classification, College Students, Computer Simulation
PDF pending restoration PDF pending restoration
White, Lee J.; And Others – 1975
The major advantage of sequential classification, a technique for automatically classifying documents into previously selected categories, is that the entire document need not be processed before it is classified. This method assumes the availability of a priori categories, a selection of keywords representative of these categories, and the a…
Descriptors: Algorithms, Automatic Indexing, Bayesian Statistics, Classification
Kar, B. Gautam; White, Lee J. – 1975
The feasibility of using a distance measure, called the Bayesian distance, for automatic sequential document classification was studied. Results indicate that, by observing the variation of this distance measure as keywords are extracted sequentially from a document, the occurrence of noisy keywords may be detected. This property of the distance…
Descriptors: Algorithms, Automatic Indexing, Bayesian Statistics, Classification