Core Methods in Educational Data Mining HUDK4050 Fall 2014.

Slides:



Advertisements
Similar presentations
Bayesian Knowledge Tracing and Discovery with Models
Advertisements

Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 January 23, 2012.
Bayesian Knowledge Tracing Prediction Models
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 January 30, 2012.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Statistics in Bioinformatics May 2, 2002 Quiz-15 min Learning objectives-Understand equally likely outcomes, Counting techniques (Example, genetic code,
Next Semester CSCI 5622 – Machine learning (Matt Wilder)  great text by Hastie, Tibshirani, & Friedman great text ECEN 5018 – Game Theory ECEN 5322 –
Navigating the parameter space of Bayesian Knowledge Tracing models Visualizations of the convergence of the Expectation Maximization algorithm Zachary.
Knowledge Inference: Advanced BKT Week 4 Video 5.
Knowledge Engineering Week 3 Video 5. Knowledge Engineering  Where your model is created by a smart human being, rather than an exhaustive computer.
Bayesian Knowledge Tracing and Other Predictive Models in Educational Data Mining Zachary A. Pardos PSLC Summer School 2011 Bayesian Knowledge Tracing.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 February 27, 2012.
Ryan S.J.d. Baker Adam B. Goldstein Neil T. Heffernan Detecting the Moment of Learning.
Week 8 Video 4 Hidden Markov Models.
Effective Skill Assessment Using Expectation Maximization in a Multi Network Temporal Bayesian Network By Zach Pardos, Advisors: Neil Heffernan, Carolina.
Cognitive Modeling February 5, Today’s Class Cognitive Modeling Assignment #3 Probing Questions Surveys.
Educational Data Mining Ryan S.J.d. Baker PSLC/HCII Carnegie Mellon University Richard Scheines Professor of Statistics, Machine Learning, and Human-Computer.
Determining the Significance of Item Order In Randomized Problem Sets Zachary A. Pardos, Neil T. Heffernan Worcester Polytechnic Institute Department of.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 February 6, 2012.
1 Educational data mining in a computer tutor that listens Joseph E. Beck Acknowledgements: NSF, Heinz.
Seeking and providing assistance while learning to use information systems Presenter: Han, Yi-Ti Adviser: Chen, Ming-Puu Date: Sep. 16, 2009 Babin, L.M.,
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Topic Models in Text Processing IR Group Meeting Presented by Qiaozhu Mei.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 February 13, 2012.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Choosing Sample Size for Knowledge Tracing Models DERRICK COETZEE.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 April 2, 2012.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Special Topics in Educational Data Mining HUDK5199 Spring term, 2013 January 28, 2013.
Advanced BKT February 11, Classic BKT Not learned Two Learning Parameters p(L 0 )Probability the skill is already known before the first opportunity.
Special Topics in Educational Data Mining HUDK5199 Spring term, 2013 February 4, 2013.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 February 22, 2012.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Assessment embedded in step- based tutors (SBTs) CPI 494 Feb 12, 2009 Kurt VanLehn ASU.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 January 25, 2012.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 February 6, 2012.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Core Methods in Educational Data Mining
Core Methods in Educational Data Mining
Core Methods in Educational Data Mining
Michael V. Yudelson Carnegie Mellon University
How to interact with the system?
Core Methods in Educational Data Mining
Special Topics in Educational Data Mining
Bayes Net Toolbox for Student Modeling (BNT-SM)
Using Bayesian Networks to Predict Test Scores
Core Methods in Educational Data Mining
Core Methods in Educational Data Mining
Detecting the Learning Value of Items In a Randomized Problem Set
Big Data, Education, and Society
Addressing the Assessing Challenge with the ASSISTment System
Knowledge Tracing Parameters can be learned with the EM algorithm!
Core Methods in Educational Data Mining
How to interact with the system?
Core Methods in Educational Data Mining
Deep Knowledge Tracing
Core Methods in Educational Data Mining
Core Methods in Educational Data Mining
Presentation transcript:

Core Methods in Educational Data Mining HUDK4050 Fall 2014

What is the Goal of Knowledge Inference?

Measuring what a student knows at a specific time Measuring what relevant knowledge components a student knows at a specific time

Why is it useful to measure student knowledge?

Key assumptions of BKT Assess a student’s knowledge of skill/KC X Based on a sequence of items that are scored between 0 and 1 – Classically 0 or 1, but there are variants that relax this Where each item corresponds to a single skill Where the student can learn on each item, due to help, feedback, scaffolding, etc.

Key assumptions of BKT Each skill has four parameters From these parameters, and the pattern of successes and failures the student has had on each relevant skill so far We can compute – Latent knowledge P(Ln) – The probability P(CORR) that the learner will get the item correct

Key assumptions of BKT Two-state learning model – Each skill is either learned or unlearned In problem-solving, the student can learn a skill at each opportunity to apply the skill A student does not forget a skill, once he or she knows it

Model Performance Assumptions If the student knows a skill, there is still some chance the student will slip and make a mistake. If the student does not know a skill, there is still some chance the student will guess correctly.

Classical BKT Not learned Two Learning Parameters p(L 0 )Probability the skill is already known before the first opportunity to use the skill in problem solving. p(T)Probability the skill will be learned at each opportunity to use the skill. Two Performance Parameters p(G)Probability the student will guess correctly if the skill is not known. p(S)Probability the student will slip (make a mistake) if the skill is known. Learned p(T) correct p(G)1-p(S) p(L 0 )

Assignment 3B Let’s go through the assignment together

Assignment 3B Any questions?

Parameter Fitting Picking the parameters that best predict future performance Any questions or comments on this?

Overparameterization BKT is overparameterized (Beck et al., 2008) Which means there are multiple sets of parameters that can fit any data

Degenerate Space (Pardos et al., 2010)

Parameter Constraints Proposed Beck – P(G)+P(S)<1.0 Baker, Corbett, & Aleven (2008): – P(G)<0.5, P(S)<0.5 Corbett & Anderson (1995): – P(G)<0.3, P(S)<0.1 Your thoughts?

Does it matter what algorithm you use to select parameters? EM better than CGD – Chang et al., 2006  A’= 0.05 CGD better than EM – Baker et al., 2008  A’= 0.01 EM better than BF – Pavlik et al., 2009  A’= 0.003,  A’= 0.01 – Gong et al., 2010  A’= – Pardos et al., 2011  RMSE= – Gowda et al., 2011  A’= 0.02 BF better than EM – Pavlik et al., 2009  A’= 0.01,  A’= – Baker et al., 2011  A’= BF better than CGD – Baker et al., 2010  A’= 0.02

Other questions, comments, concerns about BKT?

Assignment B4 Any questions?

Next Class Wednesday, October 15 B3: Bayesian Knowledge Tracing Baker, R.S. (2014) Big Data and Education. Ch. 4, V1, V2. Corbett, A.T., Anderson, J.R. (1995) Knowledge Tracing: Modeling the Acquisition of Procedural Knowledge. User Modeling and User-Adapted Interaction, 4,

The End