Core Methods in Educational Data Mining HUDK4050 Fall 2014.

Slides:



Advertisements
Similar presentations
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 March 26, 2012.
Advertisements

Ch 3.2: Solutions of Linear Homogeneous Equations; Wronskian
BPT2423 – STATISTICAL PROCESS CONTROL
Statistical Issues in Research Planning and Evaluation
Bioinformatics Finding signals and motifs in DNA and proteins Expectation Maximization Algorithm MEME The Gibbs sampler Lecture 10.
Class Discussion Chapter 2 Neural Networks. Top Down vs Bottom Up What are the differences between the approaches to AI in chapter one and chapter two?
Chapter 2: Algorithm Discovery and Design
This material in not in your text (except as exercises) Sequence Comparisons –Problems in molecular biology involve finding the minimum number of edit.
Sequence similarity.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Chapter 2: Algorithm Discovery and Design
Chapter 2: Algorithm Discovery and Design
© 2006 Pearson Addison-Wesley. All rights reserved10 A-1 Chapter 10 Algorithm Efficiency and Sorting.
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
SW388R7 Data Analysis & Computers II Slide 1 Multiple Regression – Split Sample Validation General criteria for split sample validation Sample problems.
8/15/2015Slide 1 The only legitimate mathematical operation that we can use with a variable that we treat as categorical is to count the number of cases.
Improved results for a memory allocation problem Rob van Stee University of Karlsruhe Germany Leah Epstein University of Haifa Israel WADS 2007 WAOA 2007.
Measures of Central Tendency
1 Psych 5500/6500 Statistics and Parameters Fall, 2008.
Fundamentals of Python: From First Programs Through Data Structures
Slide 1 SOLVING THE HOMEWORK PROBLEMS Simple linear regression is an appropriate model of the relationship between two quantitative variables provided.
College Algebra Prerequisite Topics Review
Core Methods in Educational Data Mining HUDK4050 Fall 2014.
Fundamentals of Python: First Programs
Genetic Algorithm.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 24 By Herbert I. Gross and Richard A. Medeiros next.
Chapter An Introduction to Problem Solving 1 1 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Chapter 2: Algorithm Discovery and Design Invitation to Computer Science, C++ Version, Third Edition.
Invitation to Computer Science, Java Version, Second Edition.
Randomized Turing Machines
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 Extending the Number System.
By the end of this session you should be able to...
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
The Central Tendency is the center of the distribution of a data set. You can think of this value as where the middle of a distribution lies. Measure.
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 2.1.
PROBLEM AREAS IN MATHEMATICS EDUCATION By C.K. Chamasese.
Measures of Central Tendency: The Mean, Median, and Mode
Sampling distributions rule of thumb…. Some important points about sample distributions… If we obtain a sample that meets the rules of thumb, then…
Protein motif extraction with neuro-fuzzy optimization Bill C. H. Chang and Author : Bill C. H. Chang and Saman K. Halgamuge Saman K. Halgamuge Adviser.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 March 16, 2012.
UNIT 5.  The related activities of sorting, searching and merging are central to many computer applications.  Sorting and merging provide us with a.
Number Sense Disambiguation Stuart Moore Supervised by: Anna Korhonen (Computer Lab)‏ Sabine Buchholz (Toshiba CRL)‏
ALGORITHMS.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Answering Descriptive Questions in Multivariate Research When we are studying more than one variable, we are typically asking one (or more) of the following.
Foundations of Research Survey Research This is a PowerPoint Show Open it as a show by going to “slide show”. Click through it by pressing any key.
Statistical Tests We propose a novel test that takes into account both the genes conserved in all three regions ( x 123 ) and in only pairs of regions.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Special Topics in Educational Data Mining HUDK5199 Spring, 2013 April 24, 2012.
Lecture 12 Huffman Algorithm. In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly.
Warsaw Summer School 2015, OSU Study Abroad Program Normal Distribution.
HANGMAN OPTIMIZATION Kyle Anderson, Sean Barton and Brandyn Deffinbaugh.
Fortran: Control Structures Session Three ICoCSIS.
Chapter 2: Algorithm Discovery and Design Invitation to Computer Science.
Banaras Hindu University. A Course on Software Reuse by Design Patterns and Frameworks.
Slide 7.1 Saunders, Lewis and Thornhill, Research Methods for Business Students, 5 th Edition, © Mark Saunders, Philip Lewis and Adrian Thornhill 2009.
10.1 Estimating with Confidence Chapter 10 Introduction to Inference.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Notes 1.2: Significant Figures
3.3 Dividing Polynomials.
Core Methods in Educational Data Mining
Learning Sequence Motif Models Using Expectation Maximization (EM)
Measuring Polygon Side Lengths
Core Methods in Educational Data Mining
Designing Experiments
Introduction to TouchDevelop
Multiple Regression – Split Sample Validation
Multiplication and Division Counting in equal steps
Frequency Distributions
Presentation transcript:

Core Methods in Educational Data Mining HUDK4050 Fall 2014

Assignment B8 Let’s go over the answers

ARM vs SPM What are the differences between – Association Rule Mining – Sequential Pattern Mining

Any questions about GPS algorithm?

Perera et al. (2009) What were the three ways that Perera et al. (2009) used sequential pattern mining? What did they learn, and how did they use the information?

Perera et al. (2009) 1.Overall uses of collaborative tools by groups 2.Sequences of collaborative tool use by different group members 3.Sequences of access of specific resources by different group members In all cases, they found common patterns and then looked at how support differed for successful and unsuccessful groups

Perera et al. (2009): Important Findings 1.Overall uses of collaborative tools by groups – Successful groups used ticketing system more than the wiki; weaker groups used wiki more – Patterns were particularly strong for group leaders

Perera et al. (2009): Important Findings 2.Sequences of collaborative tool use by different group members – Successful groups characterized by leader opening ticket and other student working on ticket – Successful groups characterized by students other than leader opening ticket, and other students working on ticket

Perera et al. (2009): Important Findings 3.Sequences of access of specific resources by different group members – The best groups had interactions around the same resource by multiple students – The poor groups did no work on tickets before closing them

Variants

Differential Sequence Mining (Kinnebrew et al., 2013) Split data into two groups Look for differences in pattern frequencies between groups

MOTIF Extraction

Motif Short, recurring pattern in a sequence of categories occurring over time

Motif in Music Short, recurring pattern of notes in a musical composition

Motif in Music What’s the motif? KIY KIY How many times does the motif occur?

Motif in Music What’s the motif? KIY KIY How many times does the motif occur? – Depends on how you define it, right? – And that’s part of the challenge…

Motif in Language Short, recurring pattern of characters in a sequence of characters occurring over time

Motif in Genetics Short, recurring pattern of genes in a sequence of genes occurring over time Typically written as letters

Goal of Motif Extraction Discern a common pattern of characters in a large corpus of characters The characters may vary slightly from case to case

Can you find the motif?

UBSWWDFKLWPRHUC JBDPXBDVEJVMBKK VBDWNLROFVUBFFW OWIFTIENDOXJXIOB AUAAOOXZAABZSBT MUAWSNTVZXSFHMI LFQRKUTFRIENDOV LOMTPOQHJVYYMFJ LWGJMVPKYOZNMSA RUPMFOHPVSPPVPT BAZXVFTPQFQJVBM HLPMOKUOXGRIENDO INUSUNSGDAAICAV XRZZWCDXOVZZJKQ VOVCROMCJTOLXYU HUVRYFREENDOBBGC AQJBVXJCAJLEMAU ONJORIFCGAUGIRN PJGCHBDQIWJJTMQ IQYQHKKBNBVDFPV JJLHWPZAYZIGGEH IGJZRMAAWJBESSS JXZFRIEMDOVZRBJY IRPWYIRJISLFVFF

How would you describe the motif? UBSWWDFKLWPRHUC JBDPXBDVEJVMBKK VBDWNLROFVUBFFW OWIFTIENDOXJXIOB AUAAOOXZAABZSBT MUAWSNTVZXSFHMI LFQRKUTFRIENDOV LOMTPOQHJVYYMFJ LWGJMVPKYOZNMSA RUPMFOHPVSPPVPT BAZXVFTPQFQJVBM HLPMOKUOXGRIENDO INUSUNSGDAAICAV XRZZWCDXOVZZJKQ VOVCROMCJTOLXYU HUVRYFREENDOBBGC AQJBVXJCAJLEMAU ONJORIFCGAUGIRN PJGCHBDQIWJJTMQ IQYQHKKBNBVDFPV JJLHWPZAYZIGGEH IGJZRMAAWJBESSS JXZFRIEMDOVZRBJY IRPWYIRJISLFVFF

Finding motifs Several algorithms

Finding motifs Variant on PROJECTION algorithm (Tompa & Buhler, 2001) used in (Shanabrook et al., 2010) – Only example of motif extraction in educational data mining so far

Big idea For each character string C that could be a motif example (e.g. all character strings of desired length) – Create a set of projections, random variations of C that vary in one or more ways

Big idea For each pair of strings C1 and C2, see how many overlaps there are between their projection matrices Take the pair with the most matches and combine into a motif – Creating multi-example motif if 3+ get added together Repeat until goal number of motifs is found, or until new motif is below criterion goodness

Motif in Education Short, recurring pattern of behaviors in a sequence of behaviors occurring over time Written as letters in Shanabrook et al. (2010)

Detail for education How do you segment student behavior? Could use student’s interaction on an entire problem, and compute letters across whole problem – Might make more sense in tutors with shorter problems Could use student’s interaction on an entire problem, and define letters differently for context within whole problem – Approach used by Shanabrook et al. (2010) Could use “sliding window” of N actions

Behaviors in Shanabrook et al. “hints (a, b, c) – Hints is a measure of the number of hints viewed for this problem. Although each problem has a maximum number of hints, the hint count does not have an upper bound because students can repeat hints and the count will increase at each repeated view. The three categories for hints are: (a) no hints, meaning that thestudent did not use the hint facility for that problem, (b) meaning the student used the hint facility, but was not given the solution, and (c) last hint solved, meaning that the student was given the solution to the problem by the last hint. As described above, this metric combines two values logged by the tutor: the count of hints seen, and an indicator that the final hint giving the answer was seen. The data could have been simply binned low, medium, high hints; however, this would have missed the significance of zero hints and using hints to reveal the problem solution.”

Behaviors in Shanabrook et al. “secFirst (d, e, f) – The seconds to first attempt is an important measure as it is during this time that the student is reading the problem and formulating their response. In previous research [6], five seconds was determined to be a threshold for this metric representing gaming: students who make a first attempt in less than five seconds are considered not working on-task. We divide secFirst into three bins: (d) less than 5 sec, (e) 5 to 30 sec, (f) greater than 30 sec. (d) represents students who are gaming the system, (e) represents a moderate time to the first attempt, (f) represents a long time to the first attempt. The cut at 30 seconds was chosen because it equalizes the distribution of bins (e and f), representing a division between a moderate and a long time to the first attempt.”

Behaviors in Shanabrook et al. “secOther (g, h, i, j, k) – This variable represents actions related to answering the problem after the first attempt was made. While the first attempt includes the problem reading and solution time, subsequent solution attempts could be much quicker and the student could still be making good effort. secOther is categorized in five bins: (g) skip, (h) solved on first, (i) 0 to 1.2 sec, (j) 1.2 to 2.9 sec, (k) greater than 2.9 sec. First, there are two categorical bins, skip and solve on first attempt. These are each determined from an indicator in the log data for that problem. Skipping a problem implies only that students never clicked on a correct answer; they could have worked on the problem and then given up, or immediately skipped to the next problem with only a quick look. Solved on first attempt indicates correctly solving the problem. If neither of the first two bins are indicated in the logs, then the secOther metric measures the mean time for all attempts after the first. The divisions of 1.2 sec and 2.9 sec for the latter three bins were obtained using the mean and one standard deviation above the mean for all tutor usage; (i) less than 1.2 seconds would indicate guessing, (j) would indicate normal attempts, and (k) would indicate a long time between attempts.”

Behaviors in Shanabrook et al. “numIncorrect – (o, p, q) - Each problem has four or five possible answer choices, that we divide into three groups: (o) zero incorrect attempts, indicates either solved on first attempt, skipped problem, or last hint solves problem (defined by the other metrics); (p) indicates choosing the correct answer in the second or third attempt, and (q) obtaining the answer by default in a four answer problem or possibly guessing when there is five answer problem.”

What other constructs could be used? What other kinds of constructs could be used for the atoms of motif analyses in educational analyses? – At this grain-size (e.g. specific actions)

What other constructs could be used? What other kinds of constructs could be used for the atoms of motif analyses in educational analyses? – At other grain-sizes?

Common Motifs {adgo, adip, adiq} {aeho, afho} {ceho} {adgo, aeho} {aeiq aeho aeho aekp aeho aeiq aeho aeip aeho aeip}

Interpretations (Shanabrook et al., 2010) {adgo, adip, adiq} – gaming the system {aeho, afho} – “This student is using the tutor appropriately, but not being challenged.” {ceho} – problem is too difficult {adgo, aeho} – student is skipping problems {aeiq aeho aeho aekp aeho aeiq aeho aeip aeho aeip} – working on-task

Do you agree with interpretations? {adgo, adip, adiq} – gaming the system {aeho, afho} – “This student is using the tutor appropriately, but not being challenged.” {ceho} – problem is too difficult {adgo, aeho} – student is skipping problems {aeiq aeho aeho aekp aeho aeiq aeho aeip aeho aeip} – working on-task

How can researchers form good interpretations?

Questions? Comments?

What else? What else could sequential pattern mining and motif extraction be used for in education? – Beyond Perera et al. and Shanabrook et al.

Assignment C4 Sequential Pattern Mining II Due Wednesday Questions?

Next Class Wednesday, December 10: Text Mining Readings Baker, R.S. (2014) Big Data and Education. Ch. 8, V3. Rose, C.P. (2014) Online Text Mining resources TBD. Graesser, A. C., D'Mello, S. K., Craig, S. D., Witherspoon A., Sullins J., McDaniel B., Gholson, B. (2008) The Relationship between Affective States and Dialog Patterns during Interactions with AutoTutor. Journal of Interactive Learning Research, 19(2),

The End