Student assessment using Bayesian nets
International Journal of Human-Computer StudiesPublished 1 June 1995
J. J. Martin, Kurt VanLehn
Citations152
SJR quartileQ1
SJR score1.39
SNIP2.34
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
OLAE is described as an assessment tool that collects data from students solving problems in introductory college physics, analyses that data with probabilistic methods that determine what knowledge the student is using, and flexibly presents the results of analysis.
Abstract
We describe OLAE as an assessment tool that collects data from students solving problems in introductory college physics, analyses that data with probabilistic methods that determine what knowledge the student is using, and flexibly presents the results of analysis. For each problem, OLAE automatically creates a Bayesian net that relates knowledge, represented as first-order rules, to particular actions, such as written equations. Using the resulting Bayesian network, OLAE observes a student's behavior and computes the probabilities that the student knows and uses each of the rules.
Keywords
Computer Science
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
16,927 Citations1988Judea Pearl
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
Cognitive ScienceCategorization and Representation of Physics Problems by Experts and Novices*
5,230 Citations1981T. H. Michelene, Paul J. Feltovich +1 more
Results from sorting tasks and protocols reveal that experts and novices begin their problem representations with specifiably different problem categories, and completion of the representations depends on the knowledge associated with the categories.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems
3,970 Citations1988Steffen L. Lauritzen, David J. Spiegelhalter
This work exploits a range of local representations for the joint probability distribution, combined with topological changes to the original network termed 'marrying' and 'filling-in', which allows efficient algorithms for transfer between representations, providing rapid absorption and propagation of evidence.
Machine LearningLearning Logical Definitions from Relations
1,425 Citations1990J. R. Quinlan
FOIL is a system that learns Horn clauses from data expressed as relations, but extends them to a first-order formalism, which has been applied successfully to several tasks taken from the machine learning literature.
Operations ResearchEvaluating Influence Diagrams
1,276 Citations1986Ross D. Shachter
An algorithm is developed that can evaluate any well-formed influence diagram and determine the optimal policy for its decisions and can be performed using the decision maker's perspective on the problem.
Artificial IntelligenceProbabilistic Horn abduction and Bayesian networks
586 Citations1993David Poole
It is shown how any probabilistic knowledge representable in a discrete Bayesian belief network can be represented in this framework, and it is argued that it is better to invent new hypotheses to explain dependence rather than having to worry about dependence in the language.
Journal of the Learning SciencesA Model of the Self-Explanation Effect
297 Citations1992Kurt VanLehn, Randolph M. Jones +1 more
Computational experiments indicate that Cascade's learning mechanisms are jointly sufficient to reproduce the self-explanation effect, and a computer model is described, Cascade, that accounts for these findings.
Mind Bugs: The Origins of Procedural Misconceptions
282 Citations1990Kurt VanLehn
Machine LearningThe Utility of Knowledge in Inductive Learning
281 Citations1992Michael J. Pazzani, Dennis Kibler
This paper demonstrates how different forms of background knowledge can be integrated with an inductive method for generating function-free Horn clause rules, and demonstrates that a hybrid explanation-based and inductive learning method can advantageously use an approximate domain theory, even when this theory is incorrect and incomplete.
Computational IntelligenceCONSTRUCTION OF BELIEF AND DECISION NETWORKS
122 Citations1992John S. Breese
A representation and set of inference techniques for the dynamic construction of probabilistic and decision‐theoretic models expressed as networks are described and an interpretation of the network construction process is developed in terms of the implicit networks encoded in the database.
Lecture notes in computer scienceProbabilistic student models: Bayesian Belief Networks and Knowledge Space Theory
96 Citations1992Michael Villano
The applicability of Knowledge Space Theory and Bayesian Belief Networks as probabilistic student models imbedded in an Intelligent Tutoring System is examined and student modeling issues such as knowledge representation, adaptive assessment, curriculum advancement, and student feedback are addressed.
International Joint Conference on Artificial IntelligenceA semantics for probabilistic quantifier-free first-order languages, with particular application to story understanding
94 Citations1989Eugene Charniak, Robert P. Goldman
A semantics for interpreting probabilistic statements expressed in a first-order quantifier-free language is presented and it is shown that once they are conditioned by an assumption of spatio-temporal locality of observation the probabilities become "reasonable."
National Conference on Artificial IntelligenceAutomated cognitive modeling
74 Citations1984Pat Langley, Stellan Ohlsson
An approach to automating the construction of cognitive process models by employing a problem reduction approach to constructing cognitive models, in which one begins with a set of independent, overly general condition-action rules, adds appropriate conditions to each of these rules, and then recombines the more specific rules into a final model.
Artificial IntelligenceGibbs sampling in Bayesian networks
65 Citations1990Tomas Hrycej
It is shown that the stochastic simulation can be viewed as a sampling from the Gibbs distribution, which is useful in making statements about convergence of the simulation and finding the most likely instantiation of the Bayesian network.
Learning by explaining examples to oneself: A computational model
46 Citations1993Kurt VanLehn, Randolph M. Jones
These findings, collectively called the self-explanation effect, have been reproduced by the cognitive simulation program, Cascade, and it predicts most of the behavior that the subject exhibits during subsequent problem solving.
Elsevier eBooksBetter Learners Use Analogical Problem Solving Sparingly
30 Citations1993Kurt VanLehn, Randolph M. Jones
ETS Research Report SeriesDIAGNOSTIC ASSESSMENT OF TROUBLESHOOTING SKILL IN AN INTELLIGENT TUTORING SYSTEM1
27 Citations1994Drew H. Gitomer, Linda S. Steinberg +1 more
The rationale and implementation of student modeling and updating in the HYDRIVE intelligent tutoring system (ITS) for aircraft hydraulic systems and the applicability of this approach to student modeling in other learning domains is discussed.
Cirrus: Inducing Subject Models from Protocol Data
5 Citations1988Bernadette Kowalski, Kurt VanLehn
The theory of problem solving that Cirrus is based on, the current implementation, its analysis of several protocols, and the plans for future improvements are described.