This document analyzes student activity data from a virtual learning environment (VLE) like Moodle to identify patterns in student behavior. The authors represent each student's activity as a time series and cluster students based on similar activity patterns over time using dynamic time warping. They identify seven prototypical clusters of student behavior across multiple courses, including "Procrastinators" with little activity until deadlines and "Strugglers" doing minimum work late. Analyzing differences in clusters between high, medium, and low grades provides insights into how activity patterns relate to outcomes. The identified patterns could help institutions structure courses to better support students.
Finding Relationships between the Our-NIR Cluster ResultsCSCJournals
The problem of evaluating node importance in clustering has been active research in present days and many methods have been developed. Most of the clustering algorithms deal with general similarity measures. However In real situation most of the cases data changes over time. But clustering this type of data not only decreases the quality of clusters but also disregards the expectation of users, when usually require recent clustering results. In this regard we proposed Our-NIR method that is better than Ming-Syan Chen proposed a method and it has proven with the help of results of node importance, which is related to calculate the node importance that is very useful in clustering of categorical data, still it has deficiency that is importance of data labeling and outlier detection. In this paper we modified Our-NIR method for evaluating of node importance by introducing the probability distribution which will be better than by comparing the results.
Dimensionality Reduction Techniques for Document Clustering- A SurveyIJTET Journal
Abstract— Dimensionality reduction technique is applied to get rid of the inessential terms like redundant and noisy terms in documents. In this paper a systematic study is conducted for seven dimensionality reduction methods such as Latent Semantic Indexing (LSI), Random Projection (RP), Principle Component Analysis (PCA) and CUR decomposition, Latent Dirichlet Allocation(LDA), Singular value decomposition (SVD). Linear Discriminant Analysis(LDA)
Finding Relationships between the Our-NIR Cluster ResultsCSCJournals
The problem of evaluating node importance in clustering has been active research in present days and many methods have been developed. Most of the clustering algorithms deal with general similarity measures. However In real situation most of the cases data changes over time. But clustering this type of data not only decreases the quality of clusters but also disregards the expectation of users, when usually require recent clustering results. In this regard we proposed Our-NIR method that is better than Ming-Syan Chen proposed a method and it has proven with the help of results of node importance, which is related to calculate the node importance that is very useful in clustering of categorical data, still it has deficiency that is importance of data labeling and outlier detection. In this paper we modified Our-NIR method for evaluating of node importance by introducing the probability distribution which will be better than by comparing the results.
Dimensionality Reduction Techniques for Document Clustering- A SurveyIJTET Journal
Abstract— Dimensionality reduction technique is applied to get rid of the inessential terms like redundant and noisy terms in documents. In this paper a systematic study is conducted for seven dimensionality reduction methods such as Latent Semantic Indexing (LSI), Random Projection (RP), Principle Component Analysis (PCA) and CUR decomposition, Latent Dirichlet Allocation(LDA), Singular value decomposition (SVD). Linear Discriminant Analysis(LDA)
INFLUENCE OF PRIORS OVER MULTITYPED OBJECT IN EVOLUTIONARY CLUSTERINGcscpconf
In recent years, Evolutionary clustering is an evolving research area in data mining. The evolution diagnosis of any homogeneous as well as heterogeneous network will provide an overall view about the network. Applications of evolutionary clustering includes, analyzing, the social networks, information networks, about their structure, properties and behaviors. In this paper, the authors study the problem of influence of priors over multi-typed object in
evolutionary clustering. Priors are defined for each type of object in a heterogeneous information network and experimental results were produced to show how consistency and quality of cluster changes according to the priors
Influence of priors over multityped object in evolutionary clusteringcsandit
In recent years, Evolutionary clustering is an evolving research area in data mining. The
evolution diagnosis of any homogeneous as well as heterogeneous network will provide an
overall view about the network. Applications of evolutionary clustering includes, analyzing, the
social networks, information networks, about their structure, properties and behaviors. In this
paper, the authors study the problem of influence of priors over multi-typed object in
evolutionary clustering. Priors are defined for each type of object in a heterogeneous
information network and experimental results were produced to show how consistency and
quality of cluster changes according to the priors.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Mapping Subsets of Scholarly InformationPaul Houle
We illustrate the use of machine learning techniques to analyze, structure, maintain,
and evolve a large online corpus of academic literature. An emerging field of research
can be identified as part of an existing corpus, permitting the implementation of a
more coherent community structure for its practitioners.
Experimental study of Data clustering using k- Means and modified algorithmsIJDKP
The k- Means clustering algorithm is an old algorithm that has been intensely researched owing to its ease
and simplicity of implementation. Clustering algorithm has a broad attraction and usefulness in
exploratory data analysis. This paper presents results of the experimental study of different approaches to
k- Means clustering, thereby comparing results on different datasets using Original k-Means and other
modified algorithms implemented using MATLAB R2009b. The results are calculated on some performance
measures such as no. of iterations, no. of points misclassified, accuracy, Silhouette validity index and
execution time
very useful for cluster analysis. supportive for engineering student as well as it students. also provide example for every topic helps in numerical problems. good material for reading.
CONCATENATED DECISION PATHS CLASSIFICATION FOR TIME SERIES SHAPELETSijcisjournal
Time-series classification is widely used approach for classification. Recent development known as timeseries shapelets, based on local patterns from the time-series, shows potential as highly predictive and accurate method for data mining. On the other hand, the slow training time remains an acute problem of this method. In recent years there was a significant improvement of training time performance, reducing the training time in several orders of magnitude. Reducing the training time degrade the accuracy in general. This work applies combined classifiers to achieve high accuracies, maintaining low training times- in the range from several second to several minutes- for datasets from the popular UCR database. The goal is achieved by training small 2,3-nodes decision trees and combining their decisions in pattern that uniquely identifies incoming time-series.
Concatenated decision paths classification for time series shapeletsijics
Time-series classification is widely used approach for classification. Recent development known as timeseries
shapelets, based on local patterns from the time-series, shows potential as highly predictive and
accurate method for data mining. On the other hand, the slow training time remains an acute problem of
this method. In recent years there was a significant improvement of training time performance, reducing
the training time in several orders of magnitude. Reducing the training time degrade the accuracy in
general. This work applies combined classifiers to achieve high accuracies, maintaining low training
times- in the range from several second to several minutes- for datasets from the popular UCR database.
The goal is achieved by training small 2,3-nodes decision trees and combining their decisions in pattern
that uniquely identifies incoming time-series.
A New Active Learning Technique Using Furthest Nearest Neighbour Criterion fo...ijcsa
Active learning is a supervised learning method that is based on the idea that a machine learning algorithm can achieve greater accuracy with fewer labelled training images if it is allowed to choose the image from which it learns. Facial age classification is a technique to classify face images into one of the several predefined age groups. The proposed study applies an active learning approach to facial age classification which allows a classifier to select the data from which it learns. The classifier is initially trained using a small pool of labeled training images. This is achieved by using the bilateral two dimension linear discriminant analysis. Then the most informative unlabeled image is found out from the unlabeled pool using the furthest nearest neighbor criterion, labeled by the user and added to the
appropriate class in the training set. The incremental learning is performed using an incremental version of bilateral two dimension linear discriminant analysis. This active learning paradigm is proposed to be applied to the k nearest neighbor classifier and the support vector machine classifier and to compare the performance of these two classifiers.
INFLUENCE OF PRIORS OVER MULTITYPED OBJECT IN EVOLUTIONARY CLUSTERINGcscpconf
In recent years, Evolutionary clustering is an evolving research area in data mining. The evolution diagnosis of any homogeneous as well as heterogeneous network will provide an overall view about the network. Applications of evolutionary clustering includes, analyzing, the social networks, information networks, about their structure, properties and behaviors. In this paper, the authors study the problem of influence of priors over multi-typed object in
evolutionary clustering. Priors are defined for each type of object in a heterogeneous information network and experimental results were produced to show how consistency and quality of cluster changes according to the priors
Influence of priors over multityped object in evolutionary clusteringcsandit
In recent years, Evolutionary clustering is an evolving research area in data mining. The
evolution diagnosis of any homogeneous as well as heterogeneous network will provide an
overall view about the network. Applications of evolutionary clustering includes, analyzing, the
social networks, information networks, about their structure, properties and behaviors. In this
paper, the authors study the problem of influence of priors over multi-typed object in
evolutionary clustering. Priors are defined for each type of object in a heterogeneous
information network and experimental results were produced to show how consistency and
quality of cluster changes according to the priors.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Mapping Subsets of Scholarly InformationPaul Houle
We illustrate the use of machine learning techniques to analyze, structure, maintain,
and evolve a large online corpus of academic literature. An emerging field of research
can be identified as part of an existing corpus, permitting the implementation of a
more coherent community structure for its practitioners.
Experimental study of Data clustering using k- Means and modified algorithmsIJDKP
The k- Means clustering algorithm is an old algorithm that has been intensely researched owing to its ease
and simplicity of implementation. Clustering algorithm has a broad attraction and usefulness in
exploratory data analysis. This paper presents results of the experimental study of different approaches to
k- Means clustering, thereby comparing results on different datasets using Original k-Means and other
modified algorithms implemented using MATLAB R2009b. The results are calculated on some performance
measures such as no. of iterations, no. of points misclassified, accuracy, Silhouette validity index and
execution time
very useful for cluster analysis. supportive for engineering student as well as it students. also provide example for every topic helps in numerical problems. good material for reading.
CONCATENATED DECISION PATHS CLASSIFICATION FOR TIME SERIES SHAPELETSijcisjournal
Time-series classification is widely used approach for classification. Recent development known as timeseries shapelets, based on local patterns from the time-series, shows potential as highly predictive and accurate method for data mining. On the other hand, the slow training time remains an acute problem of this method. In recent years there was a significant improvement of training time performance, reducing the training time in several orders of magnitude. Reducing the training time degrade the accuracy in general. This work applies combined classifiers to achieve high accuracies, maintaining low training times- in the range from several second to several minutes- for datasets from the popular UCR database. The goal is achieved by training small 2,3-nodes decision trees and combining their decisions in pattern that uniquely identifies incoming time-series.
Concatenated decision paths classification for time series shapeletsijics
Time-series classification is widely used approach for classification. Recent development known as timeseries
shapelets, based on local patterns from the time-series, shows potential as highly predictive and
accurate method for data mining. On the other hand, the slow training time remains an acute problem of
this method. In recent years there was a significant improvement of training time performance, reducing
the training time in several orders of magnitude. Reducing the training time degrade the accuracy in
general. This work applies combined classifiers to achieve high accuracies, maintaining low training
times- in the range from several second to several minutes- for datasets from the popular UCR database.
The goal is achieved by training small 2,3-nodes decision trees and combining their decisions in pattern
that uniquely identifies incoming time-series.
A New Active Learning Technique Using Furthest Nearest Neighbour Criterion fo...ijcsa
Active learning is a supervised learning method that is based on the idea that a machine learning algorithm can achieve greater accuracy with fewer labelled training images if it is allowed to choose the image from which it learns. Facial age classification is a technique to classify face images into one of the several predefined age groups. The proposed study applies an active learning approach to facial age classification which allows a classifier to select the data from which it learns. The classifier is initially trained using a small pool of labeled training images. This is achieved by using the bilateral two dimension linear discriminant analysis. Then the most informative unlabeled image is found out from the unlabeled pool using the furthest nearest neighbor criterion, labeled by the user and added to the
appropriate class in the training set. The incremental learning is performed using an incremental version of bilateral two dimension linear discriminant analysis. This active learning paradigm is proposed to be applied to the k nearest neighbor classifier and the support vector machine classifier and to compare the performance of these two classifiers.
Predicting Students Performance using K-Median ClusteringIIRindia
The main objective of education institutions is to provide quality education to its students. One way to achieve highest level of quality in higher education system is by discovering knowledge of students in a particular course. The knowledge is hidden among the educational data set and it is extractable through data mining techniques. In this paper, the K-Median method in clustering technique is used to evaluate students performance. By this task the extracted knowledge that describes students performance in end semester examination. It helps earlier in identifying the students who need special attention and allow the teacher to provide appropriate advising and coaching.
Student Performance Evaluation in Education Sector Using Prediction and Clust...IJSRD
Data mining is the crucial steps to find out previously unknown information from large relational database. various technique and algorithm are their used in data mining such as association rules, clustering and classification and prediction techniques. Ease of the techniques contains particular characteristics and behaviour. In this paper the prime focus on clustering technique and prediction technique. Now a days large amount of data stored in educational database increasing rapidly. The database for particular set of student was collected. The clustering and prediction is made on some detailed manner and the results were produce. The K-means clustering algorithm is used here. To find nearest possible a cluster a similar group the turning point India is the performance in higher education for all students. This academic performance is influenced by various factor, therefore to identify the difference between high learners and slow learner students it is important for student performance to develop predictive data mining model.
A Novel Clustering Method for Similarity Measuring in Text DocumentsIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
Evaluating the Use of Clustering for Automatically Organising Digital Library...pathsproject
Paper by Mark M. Hall, Mark Stevenson and Paul D. Clough from the Information School /Department of Computer Science, University of Sheffield, UK
24-27 September 2012
TPDL 2012, Cyprus
Max stable set problem to found the initial centroids in clustering problemnooriasukmaningtyas
In this paper, we propose a new approach to solve the document-clustering using the K-Means algorithm. The latter is sensitive to the random selection of the k cluster centroids in the initialization phase. To evaluate the quality of K-Means clustering we propose to model the text document clustering problem as the max stable set problem (MSSP) and use continuous Hopfield network to solve the MSSP problem to have initial centroids. The idea is inspired by the fact that MSSP and clustering share the same principle, MSSP consists to find the largest set of nodes completely disconnected in a graph, and in clustering, all objects are divided into disjoint clusters. Simulation results demonstrate that the proposed K-Means improved by MSSP (KM_MSSP) is efficient of large data sets, is much optimized in terms of time, and provides better quality of clustering than other methods.
A survey on Efficient Enhanced K-Means Clustering Algorithmijsrd.com
Data mining is the process of using technology to identify patterns and prospects from large amount of information. In Data Mining, Clustering is an important research topic and wide range of unverified classification application. Clustering is technique which divides a data into meaningful groups. K-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. In this paper, we present the comparison of different K-means clustering algorithms.
COMBINED CLASSIFIERS FOR TIME SERIES SHAPELETScscpconf
Time-series classification is widely used approach for classification. Recent development known as time-series shapelets, based on local patterns from the time-series, shows potential as highly predictive and accurate method for data mining. On the other hand, the slow training time remains an acute problem of this method. In recent years there was a significant improvement of training time performance, reducing the training time in several orders of magnitude. This work tries to maintain low training time- in the range from several second to several minutes for datasets from the popular UCR database, achieving accuracies up to 20% higher than the fastest known up to date method. The goal is achieved by training small 2,3-nodes decision trees and combining their decisions in pattern that uniquely identifies incoming time-series.
COMBINED CLASSIFIERS FOR TIME SERIES SHAPELETScsandit
Time-series classification is widely used approach for classification. Recent development known as time-series shapelets, based on local patterns from the time-series, shows potential as highly predictive and accurate method for data mining. On the other hand, the slow training time
remains an acute problem of this method. In recent years there was a significant improvement of training time performance, reducing the training time in several orders of magnitude. This work tries to maintain low training time- in the range from several second to several minutes for
datasets from the popular UCR database, achieving accuracies up to 20% higher than the fastest known up to date method. The goal is achieved by training small 2,3-nodes decision trees and combining their decisions in pattern that uniquely identifies incoming time-series
1. Time Series Analysis of VLE Activity Data
Ewa Młynarska
Insight Centre, University
College Dublin, Ireland
ewa.mlynarska@insight-
centre.org
Derek Greene
Insight Centre, University
College Dublin, Ireland
derek.greene@ucd.ie
Pádraig Cunningham
Insight Centre, University
College Dublin, Ireland
padraig.cunningham@ucd.ie
ABSTRACT
Virtual Learning Environments (VLE), such as Moodle, are
purpose-built platforms in which teachers and students in-
teract to exchange, review, and submit learning material
and information. In this paper, we examine a complex VLE
dataset from a large Irish university in an attempt to charac-
terize student behavior with respect to deadlines and grades.
We demonstrate that, by clustering activity profiles rep-
resented as time series using Dynamic Time Warping, we
can uncover meaningful clusters of students exhibiting sim-
ilar behaviors even in a sparsely-populated system. We use
these clusters to identify distinct activity patterns among
students, such as Procrastinators, Strugglers, and Experts.
These patterns can provide us with an insight into the be-
havior of students, and ultimately help institutions to ex-
ploit deployed learning platforms so as to better structure
their courses.
Keywords
Learning analytics, Data mining, Moodle, Time series, VLE
1. INTRODUCTION
The availability of log data from virtual learning environ-
ments (VLEs) such as Moodle presents an opportunity to
improve learning outcomes and address challenges in the
third level sector. We propose representing a student’s ef-
forts as a complete time-series of activity counts. We anal-
yse yearly anonymised Moodle activity data from 13 Com-
puter Science courses at University College Dublin (UCD),
Ireland, and seek to identify patterns and relationships be-
tween more than one attribute that might lead to a student
failing a course. A major potential benefit of this would be
to introduce mechanisms identifying issues in the learning
system early during the semester, supporting interventions
and changes in the way in which a course is delivered.
A large amount of previous research in this area relates to
different activity types, which are most predictive for a sin-
gle dataset [1, 3]. This makes it difficult to generalise those
methods to systems where the type and volume of Moo-
dle activity can vary significantly. In order to facilitate
the performance prediction on less structured systems, we
need methods incorporating multiple features to deal with
the sparsity problem. As a solution, we present a method
for mining student activity on sparse data via Time Series
Clustering. We explore the use of Dynamic Time Warp-
ing (DTW) as an appropriate distance measure to cluster
students based on their activity patterns, so as to achieve
clustering indicating more structured activity patterns influ-
encing students’ grades. DTW allows two time series that
are similar but out of phase to be aligned to one another.
To gain a macro-level view regarding whether these pat-
terns occur across all assignments, we subsequently perform
a second level aggregate clustering on the clusters coming
from each assignment. This results in seven prototypical
behaviour patterns (see example in Figure 1), that we be-
lieve can lead to better understanding of the behaviour of
larger groups of students in VLEs.
2. TIME SERIES ANALYSIS
To perform clustering, the Moodle activity data was trans-
formed into a series of equispaced points in time. In our
case, a time series is a three week timeline – from two weeks
before a given assignment submission date until one week af-
ter the deadline. These timelines were divided into 12 hour
buckets of activity counts. We applied k-means clustering
using DTW as a distance measure to cluster the timelines
for each assignment. For a given number of clusters k, the
algorithm was repeated 10 times and the best clustering was
selected (based on the fitness score explained below). Due
to the fact that DTW is not a true metric, k-means is not
guaranteed to converge, so we limited each run to a maxi-
mum of 50 iterations. To choose the size of the DTW time
window, we ran k-means for window sizes ∈ [0, 3]. The re-
sults did not conclusively indicate that any single window
size leads to a significant decrease in cluster grade variance,
which is unsurprising. In cases where there are many time
series exhibiting little activity, it will be difficult to differen-
tiate between the series and so a larger window size will be
more appropriate. Based on this rationale, we believe that
window size selection should be run for each assignment sep-
arately when applying this type of analysis in practice. The
fitness function helping in selection of the best clustering
needs to take into consideration that two clusters of differ-
ent sizes might have the same variance value; this issue can
be solved by applying a penalty to smaller clusters. We also
Proceedings of the 9th International Conference on Educational Data Mining 613
2. 0
0.1
0.2
0.3
0.4
0.5
0
5
10
15
20
25
28 26 24 22 20 18 16 14 12 10 8 6 4 2 -1 -3 -5 -7 -9 -11 -13
Prototype pattern
Activity count
Time
Procrastinators (low grade)
0
0.1
0.2
0.3
0.4
0.5
0
5
10
15
20
25
28 26 24 22 20 18 16 14 12 10 8 6 4 2 -1 -3 -5 -7 -9 -11 -13
Prototype pattern
Activity count
Time
Strugglers (low grade)
Figure 1: Two of the seven prototype activity pat-
terns that occurred in Assignment #1. The black
trend-line represents the prototype pattern. The
coloured lines represent the activities of individual
students. Negative numbers on the Time axis rep-
resent time after the deadline.
would like a “balanced clustering” where the variance of the
cluster sizes is as small as possible. Based on these require-
ments, the fitness score calculation for a clustering generated
by k-means consists of three steps:
1. The mean variance of the k-means clustering is calcu-
lated using the weighted average of all the clusters’ vari-
ances, where the weight is based on the size of the clus-
ter. This way the clusterings containing larger clusters
with lower variances will be awarded better scores.
2. It is crucial to test the difference between a baseline
clustering and actual results to define the significance
of the clustering. For that purpose we run multiple
random assignments of time series to calculate the ex-
pected score which could be achieved by chance for a
given number of clusters.
3. To incorporate the baseline comparison in the score,
the weighted average variance score from Step 1 is nor-
malised with respect to the random assignment score
from Step 2. A good clustering should achieve a low
resulting score.
3. DISCUSSION
In our analysis, we took into account 52 two weeks assign-
ments due to their longer and richer time series. We applied
the time series clustering methodology described in previ-
ous section to the activity data for each of the assignments
in the dataset, which are naturally split into two semesters.
The Semester 1 clusterings appeared to show a number of
frequently-appearing patterns across different courses. To
gain a deeper insight into these patterns, we applied a second
level of clustering – i.e. a clustering of the original clusters
from all assignments. To support the comparison of clusters
originating from different modules, the mean time series for
each cluster was normalised. Based on the associated as-
signment scores, these normalised series were then stratified
into low, medium, and high grade groups. We subsequently
applied time series clustering with k = 4 and window size
1 to the normalised series in each of the stratified groups.
Grade group names chosen by us were motivated by the
behavioural pattern of students and some of them were in-
spired by previous research [2]. This second level of cluster-
ing revealed seven distinct prototypical patterns, which are
present across multiple assignments and courses: Procrasti-
nators, Unmotivated, Strugglers, Systematic, Hard-workers,
Strategists and Experts.
The students rewarded with low grades were the second
largest group of submissions after medium graded submis-
sions having the smallest average activity per submission.
The first out of 3 largest clusters was a group barely active
on Moodle, performing submission activity at the deadline
only (See Figure 1). As mentioned by Cerezo et al. [2], these
could be labelled as Procrastinators. The black trend-line
on the graph depicts prototype activity pattern and group
of time series represents activity of students from the sam-
ple cluster. The third biggest group contains those students
doing the minimum amount of work and showing larger ac-
tivity towards the deadline (see Figure 1). The second aca-
demic semester courses mostly exhibit similar clusters from
the first semester. The percentages indicate that for the
Low Grade group, the Strugglers were most common and
Procrastinators were less common.
While we did observe significant numbers of outliers, the rel-
evant courses should be considered using a separate analysis
to determine whether external factors are at play (e.g. con-
tinuous assessment rather than discrete assignments, lack of
material provided on Moodle for a specific course). Finally,
it is worth exploring anomalous clusters in the context of ac-
tivity outside that assignment or course. We are currently
in the process of extending our research to address the be-
havioural patterns of knowledge seekers in alternative, more
complex learning environments.
Acknowledgments
This publication has emanated from research conducted with
the financial support of Science Foundation Ireland (SFI)
under Grant Number SFI/12/RC/2289.
4. REFERENCES
[1] C. Brooks, C. Thompson, and S. Teasley. A time series
interaction analysis method for building predictive
models of learners using log data. In Proc. 5th
International Conference on Learning Analytics And
Knowledge., ACM, 2015.
[2] R. Cerezo, M. Sanchez-Santillan, J.C. Nunez, and M.P.
Paule. Different patterns of students’ interaction with
moodle and their relationship with achievement. In
Proc. 8th International Conference on Educational
Data Mining, 2015.
[3] L. V. Morris, C. Finnegan, and S. Wu. Tracking
student behavior, persistence, and achievement in
online courses. The Internet and Higher Education,
8.3:221–231, 2005.
Proceedings of the 9th International Conference on Educational Data Mining 614