Simplified categorizations have often led to college students being labeled as full-time or part-time students. However, at many universities student enrollment patterns can be much more complicated, as it is not uncommon for students to alternate between full-time and part-time enrollment each semester based on finances, scheduling, or family…

Massive online Open Courses (MOOCs) make extensive use of videos. Students interact with them by pausing, seeking forward or backward, replaying segments, etc. We can reasonably assume that students have different patterns of video interactions, but it remains hard to compare student video interactions. Some methods were developed, such as Markov…

In this study, we applied decision trees (DT) to extract a compact set of pedagogical decision-making rules from an original "full" set of 3,702 Reinforcement Learning (RL)- induced rules, referred to as the DT-RL rules and Full-RL rules respectively. We then evaluated the effectiveness of the two rule sets against a baseline Random…

The extraction of student behavior is an important task in educational data mining. A common approach to detect similar behavior patterns is to cluster sequential data. Standard approaches identify clusters at each time step separately and typically show low performance for data that inherently suffer from noise, resulting in temporally…

An important, yet largely unstudied problem in student data analysis is to detect "misconceptions" from students' responses to "open-response" questions. Misconception detection enables instructors to deliver more targeted feedback on the misconceptions exhibited by many students in their class, thus improving the quality of…

We seek to simplify the creation of intelligent tutors by using student data acquired from standard computer aided instruction (CAI) in conjunction with educational data mining methods to automatically generate adaptive hints. In our previous work, we have automatically generated hints for logic tutoring by constructing a Markov Decision Process…

The Markov random graphs of O. Frank and D. Strauss (1986) and the estimation strategy for these models developed by Strauss and M. Ikeda (1990) are promising contributions. This paper describes a large class of models that can be used to investigate structure in social networks and illustrates their use. (SLD)