<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>ORCID:</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Machine learning for learning personalization to enhance student academic performance</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Juan Carlos Muñoz-Carpio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zohaib Jan</string-name>
          <email>muhammad.jan@unisa.edu.au</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Angelo Saavedra</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Central Queensland University</institution>
          ,
          <addr-line>160 Ann Street, Brisbane</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Torrens University</institution>
          ,
          <addr-line>Fortitude Valley, Brisbane</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of New England</institution>
          ,
          <addr-line>Elm Avenue, Armidale</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University of South Australia</institution>
          ,
          <addr-line>Mawson Lakes, Adelaide</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
      </contrib-group>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>Machine learning, and artificial intelligence have allowed assessment of large and complex datasets for various analytical purposes such as predicting and forecasting, segmenting, object detection etc. They influence many sectors and industries, including the field of education in identifying whether a student's engagement and learning performance can impact their academic success. These improvements are creating new teaching and learning strategies to enhance students' performance and their overall education. Since datasets are prone to randomness and noise and are generally unbalanced, which is especially true for academic datasets. Therefore, this hinders the learning capabilities of a machine learning model. In this paper, we propose a new performance prediction model using an optimized ensemble classifier which is a type of a machine learning model for predicting students' learning performance using and unbalanced datasets. The results are compared with existing state-of-the-art ensemble boosting, currently used in the literature. The results of the proposed model using a student dataset reveals an accuracy of more than 80%. ensemble classification Machine learning, student performance prediction, learning performance, educational data,</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Demand for the use of machine learning algorithms in predictive analyses has increased since the
explosion of data in real-world scenarios. In particular, the shift to online learning due to the recent
pandemic was inevitable and therefore, new learning paradigms were developed. As such, identifying
key factors or predicting students’ academic performance given a set of background information will
prove beneficial not only for the instructors but also for the learners. The current learning management
system is used to support the processes in formal learning settings and so needs to be updated to match
present-day requirements. Well known examples include the open-source packages Moodle and Sakai,
XVI LATIN AMERICAN CONFERENCE ON LEARNING TECHNOLOGIES, October 19–21, 2021, Arequipa, Perú</p>
      <p>
        2020 Copyright for this paper by its authors.
as well as commercial products such as the Blackboard system used by universities worldwide. Machine
learning and its applications, particularly in learning personalization, are gaining popularity, including
learning assessments to improve students’ outcomes through design assessment and feedback [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Some
of this specialist focus on information classification, student competencies and retrieval technique in
natural language processing, well known as report-based method and metanalysis, is used to identify a
person’s competences [
        <xref ref-type="bibr" rid="ref2 ref3">2,3</xref>
        ]. The need for machine teaching forces the knowledge to be externalized
into content, also frequently called learning material, in the form of web-based training material.
Knowledge in traditional enhanced learning approaches and learning material content can be considered
standardized, externalized, and structured. However, data of the learning process from problem solvers
and their learning actions can be measured, assembled, scrutinized, and reported using learning
analytics (LA). In this regard LA contributes to enhance both the learning process and the environment
in which it occurs. It provides appropriate and timely feedback regarding learning processes to
stakeholders (teachers, administrators, parents, and students) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. For example, an approach towards
structured knowledge can also include the use of videos and haptic tools that can be employed as part
of the process-oriented learning. The use of personalized learning materials as resources that may be
provided to learners in the most efficient way to help them learn more effectively [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        In this instance, content, learning challenges and activities can be created as sources to facilitate
learning processes and therefore to augment understanding and enhance learning. Elaboration of
cognitive learning models can be applied to predict students’ learning behaviors toward the use of
technology-enhanced learning. According to [
        <xref ref-type="bibr" rid="ref6 ref7">6,7</xref>
        ] the cognitive architecture that has been applied to
predict student’s behavior as they use technology-enhanced learning to model the cognition of the
learner from their interaction with the system. The design of a collaborative learning approach must
enable learning immersion in a scaffolding manner; this cannot be achieved by merely providing a set
of learning tools or collaborative group tasks to enhance learners’ competency [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. According to [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ],
there are five conditions for making collaborative learning superior than competitive learning or
individual learning: (1) positive interdependence (everyone is working towards the same goals), (2)
individual accountability/personal responsibility (everyone is responsible for themselves), (3)
interaction promotion (interaction that is mostly face-to-face), (4) interpersonal and small group skills
(use of communication abilities to collaborate effectively and perform well as part of a team), and (5)
to increase the efficacy of the group, it should be evaluated often and on a regular basis. In this instance,
the collaborative learning design uses a method that examines collaboration and student experience
with no tutor intervention [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In this context, machine learning can be used as it can support an
automated process of analysis to monitor learning performance. Figure 1 is a visualization of the
relationship between traditional technology-enhanced learning approaches and machine teaching.
In the field of predictive analytics, ensemble classifiers [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] are a popular machine learning
methodology that aim to improve single classifiers classification performance by fusing together
multiple classifiers. By taking advantage of perturb and combine [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], single classifier models are
outperformed by ensemble classifiers. Ensemble classifiers use an approach known as the random
subspace method [
        <xref ref-type="bibr" rid="ref14 ref15">14,15</xref>
        ] to perturb a given input, in which random sub-samples of the input data are
created to train a large number of classifiers on. The students’ academic dataset, as originally proposed
by [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], is generally divided into three classes. The sample distributions of students belonging to
different grade classes is not the same; as a result, any prediction model developed using such data will
be skewed. In this study we present a new ensemble classifier methodology that will mitigate the class
imbalance through the incorporation of clustering and optimization.
      </p>
      <p>The purpose of this research is to investigate the use of machine learning approaches for predictive
analytics such ensemble classifiers to predict a student’s academic performance based on demographic,
interaction, class participation and various other features. The contributions of this paper are as follows:
•
•
•</p>
      <p>A methodology of utilizing ensemble classifiers for predicting academic performance
A novel methodology of optimizing machine learning model on biased data</p>
      <p>Experimental analysis on academic as well as benchmark datasets</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <p>
        This section discusses the application of machine learning in education, specifically the different
machine learning techniques used to predict student performance and success. This is particularly
important because predicting each student’s performance will enable educators to identify potential
poor performers and providing further assistance to the students at risk [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Such support can take the
form of additional learning activities, resources and learning tasks [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. In fact, identifying students
who are more likely to drop out of classes early allows for the timely deployment of support
mechanisms to keep these students from dropping out. [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Moreover, this information is useful for
the successful implementation of student retention strategies, which directly affects graduation rates
[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. To predict students' performance, the authors used decision trees, neural networks, naïve Bayes
method, instance-based learning algorithms, logistic regression, and support vector machines.
      </p>
      <p>
        Decision tree is a non-parametric supervised learning method used for classification and regression.
The objective is to learn basic decision rules derived from data attributes to forecast the value of a target
variable. A decision tree algorithm seeks for the most efficient way to divide data into portions that are
as homogenous as feasible [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. For example, [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] built a model that uses decision tree algorithms to
help students in an introductory programming course predict their anticipated final scores. Decision
trees have several advantages, including being simple to process, requiring minimal data preparation,
handling both numerical and categorical data, and performing well even when the underlying model
from which the data were created violates some assumptions. In addition, the model can be validated
using statistical testing, in this way accounting for the reliability of the model.
      </p>
      <p>
        Another type of inductive learning is artificial neural networks. They are based on computer models
of biological neurons and neural networks that are similar to the human central nervous system [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
These networks are densely interconnected and have an intrinsic proclivity for learning from experience
as well as uncovering new information. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Classification occurs in two independent stages. First, to
identify the input-output mapping, the network is first trained on a collection of paired data. The
network is then utilized to determine the classifications of a fresh batch of data once the weights of the
connections between neurons have been fixed. [
        <xref ref-type="bibr" rid="ref17 ref18">17,18</xref>
        ]. Due to the self-learning and self-adapting
features, this method has been effectively used to address complex real-world problems [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. For
example [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], built a user-friendly software solution for forecasting the performance of students
enrolled in a secondary school mathematics class (Lyceum) in Greece using neural network classifiers.
They determined that their model was more consistent and produced better classification results than
the other classifiers (e.g. decision trees, Bayesian networks, classification rules and support vector
machines).
      </p>
      <p>
        The "naïve" assumption of conditional independence between any pair of features given the value
of the class variable underpins a set of supervised learning techniques based on Bayes' theorem. This
algorithm captures the assumption that every attribute is independent from other attributes given the
state of the class attribute [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Although it is considered the simplest form of a Bayesian network [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ],
In many real-world contexts, such as document categorization and spam filtering, naïve Bayes
classifiers have performed well. In educational settings, naïve Bayes was used in combination with
classifications [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and a decision tree model [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] to predict the students’ academic success.
Instancebased learning algorithms derive from the nearest neighbor pattern classifier [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. They are highly
similar to the modified nearest neighbor algorithms, which store and use only a few occurrences to
make classification predictions [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. In contrast to the non-incremental edited closest neighbor method,
which has the primary purpose of keeping consistency with the initial training set, instance-based
learning algorithms are incremental, and their goal is to maximize classification accuracy on future
given cases [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
      </p>
      <p>
        Logistic regression is a linear model commonly used to predict student success. For example, it has
been used by the Noel-Levitz Corporation in the United States to identify new students’ chances of
withdrawal based on their records and known entry characteristics (e.g. sex, age and previous
qualifications) [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. It is predicted that some elements would have a considerably bigger effect on
students' chances of success than others, the study generates an algorithm weighted for various aspects.
Likewise, at Napier University in the UK, a logistic regression model indicated a link between dropping
out and working while a student – students who worked more than 15 hours per week had a greater
likelihood of dropping out. As a result, it may be advised to these students that they limit their working
hours [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
      </p>
      <p>
        Support vector machines are a type of supervised learning algorithms that may be used for
classification, regression, and outlier identification. [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] proposed an ensemble support vector machine
model based on almost 100 features, including psychological educational factors, for predicting a
student’s graduation. Using data from a state university in the US, the model turned out to be effective
in predicting students’ graduation with a high level of accuracy and precision. Another example is [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ],
who used and compared four data mining methods to predict student failure: decision tree, random
forest, neural network, and support vector machine. In this paper, we propose a clustering-based
ensemble as a contribution to the research. By applying a clustering ensemble, we expect a more
accurate prediction of students’ academic performance. In terms of consistency, dependability, and
accuracy, a successful clustering ensemble should be able to outperform the individual clustering
methods [
        <xref ref-type="bibr" rid="ref27 ref28">27,28</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Proposed Methodology</title>
      <p>The proposed ensemble learning framework starts by generating data sub-samples through cluster
centroid methodology and then trains a collection of different base classifiers on all created
subsamples. This results in generating a pool of trained base classifiers that is represented as a binary
combinatorial problem that is optimized to choose the optimum subset of classifiers that can maximize
ensemble accuracy.
3.1.</p>
    </sec>
    <sec id="sec-4">
      <title>Sub-samples generation</title>
      <p>Due to the presence of randomness and noise, the datasets are not perfectly balanced, meaning that
the number of samples are not evenly distributed across the different classes. Consequently, this will
affect the training process of not only single classifiers but also the ensemble of classifiers. Any
classifier that is trained on an unbalanced dataset will be biased towards the majority class, therefore
affecting the generalization performance of the classifier. Ensemble classifiers generally train a
multitude of classifiers to generate the base classifier by employing subsampling techniques. For
example, bagging is a common strategy used to generate bags of input data and train multiple classifiers
on generated bags. However, if the dataset is biased or unbalanced, the generated bags will also be
biased. Therefore, to avoid this issue in this study, we utilize a cluster centroid method of
undersampling. The centroids of generated data clusters of the majority class are used to match the number
of samples of the minority class. This causes the majority class, which is essentially overwhelming the
minority class, to be under-sampled without losing a large portion of critical information.
3.2.</p>
    </sec>
    <sec id="sec-5">
      <title>Base classifier pool generation</title>
      <p>A group of different base classifiers (e.g., artificial neural networks, support vector machine,
decision tree, K-nearest neighbor, and naïve Bayes) is trained on the under-sampled, optimally balanced
dataset to form the base classifier pool. These classifiers are distinct in their nature and carry with them
a variety of learning capacities.</p>
      <p>( ) = (
+ 
)/(
+ 
+ 
+ 
)
where TP is the true positive score, TN is the true negative score, FP is the false positive score, and FN
is the false negative score. For a dataset  = {( 1,  1), {( 2,  2), … {(  ,   )} containing d-dimensional
feature vectors  ∈ ℝ , each associated with a discrete class label  ∈ {1,2,3, … ,  }. These scores are
calculated using the predicted class labels  ′ of the ensemble  generated by using the validation data
set as input for each of the classifiers  in the subset:
where  is a possible ensemble solution consisting of a subset of a base classifier from the pool of
trained base classifiers  and  ( ) is the objective function/cost function of the optimisation process,
given as:
 = { ( )1,  ( )2, … ,  ( )</p>
      <p>}
 ′ =</p>
      <p>( )</p>
    </sec>
    <sec id="sec-6">
      <title>Base classifier pool optimization</title>
      <p>Selecting the optimal subset of base classifiers from a generated pool of trained base classifiers is
referred to as a binary combinatorial problem. It is established in research that binary combinatorial
problems are NP-hard problems, especially for a large search space. Therefore, in this study the base
classifier pool is represented as a binary combinatorial optimization problem. For this purpose, binary
particle swarm optimization (BPSO) is utilized as a black box tool to optimize the pool of trained base
classifiers. BPSO takes in a set of candidate solutions (a subset of base classifiers) and tries to find the
best solution that can maximize the generalization ability of the ensemble using an updated
position/velocity update method. The problem for optimization is formulated as follows:
The mode of the predictions is taken to generate the final ensemble solution, which depicts majority
voting and is given as:</p>
    </sec>
    <sec id="sec-7">
      <title>4. Experiments and Analysis</title>
      <p>
        To analyze the efficacy of the proposed optimized ensemble classifier, a dataset that categorizes
student academic performance was used [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] given demographic features, academic background,
parents’ participation, and behavior attributes is used (please refer to the relevant publication for further
information). The dataset has three prediction classes, H (higher distinction), M (medium distinction),
and L (lower distinction). There are 142 samples from H group, 211 from M group and 127 from L
group, so there is a clear imbalance in the sample distribution of various classes and the dataset is biased
towards M group. A snapshot of the student academic dataset is given in Table 1.
      </p>
      <p>A 10-fold cross validation was performed to incorporate randomization, and classification accuracy
over 10 folds was averaged and reported. The proposed ensemble learning framework was implemented
in Python using default implementation of the base classifiers from the ScikitLearn library and cluster
centroid method from the Imbalance learning library.
(1)
(2)
(3)
(4)
Some of the variables in Table 1 such as the number of times student interacted in the class or visited
the e-resources are collected using the learning management system called Kalboard 360 e-learning
system.
4.1.</p>
      <p>Results and analysis of student’s dataset</p>
      <p>As stated earlier the number of samples is not the same from different classes causing biasness in
the predictive performance of learning classifiers. Therefore, to mitigate the issue the cluster centroid
method discards almost 10% of the samples from the majority class to accommodate for the minority
classes. This is done so that the majority class does not overwhelm the minority data class causing a
biasness towards the majority class. Figure 2 below shows the sample distribution of various classes in
3 different clusters after conducting a cluster centroid under sampling. It can be noted that after
undersampling the majority class approximately equal number of samples are present in each data cluster.
The average classification accuracy over 10- folds of the proposed approach is given in Table 2. It can
be noted from Table 2 that the proposed ensemble approach achieved higher classification accuracy
than the legacy ensemble classifiers which were initially used to classify the dataset.</p>
      <p>As shown in Table 2, the proposed ensemble approach achieved higher classification accuracy than
legacy ensemble classifiers and is more appropriate for imbalance datasets. This is a clear indication
that as we progress deeper into the information age the amount of data is and will increase exponentially.
Consequently, the field of predictive analytics will be relied upon more and more. However, the curse
of dimensionality, noise and randomness will continue to plague the data that is generated, and existing
models need to be revised accordingly to leverage the power of machine learning and availability of
data to assist in facilitating a more conducive learning environment. Therefore, the existing learning
management systems can leverage on the power of machine learning models to identify students in the
system and flag students that will need further assistance or help before they show poor academic
performance.
4.2.</p>
    </sec>
    <sec id="sec-8">
      <title>Results and analysis on UCI dataset benchmark dataset</title>
      <p>
        Nine machine learning benchmarking classification datasets from the University of California Irvine
repository were utilized to further examine the performance of the suggested ensemble technique in this
study. The specifics of these datasets are shown in Table 3 below.
The average classification accuracy is collated and compared with existing state-of-the-art ensemble
classifier techniques [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. The classification accuracies are derived from the relevant studies and are
given in Table 4, with the greatest classification accuracies in bold.
      </p>
      <p>It can be shown that the suggested ensemble classifier generated performance increases of 1.33%
over OEC-ILC, 1.77% over bagging, and 2.79% over boosting. Thus, adding to the fact that the
proposed approach can not only be effective for academic datasets but other unbalanced datasets as
well.</p>
      <sec id="sec-8-1">
        <title>5. Discussion</title>
        <p>This study proposed an ML-based model for predicting student’s academic performance. The same
model was tested on a real-world dataset as well as benchmark datasets. Due to noise and randomness
the datasets are biased and most of the times having more samples from the class that a user is not
interested in. Ensemble classifier models are known to be effective when there is a bias in a dataset
because they control the bias and variance by employing various strategies. Therefore, this study
proposed and tested the efficacy of ensemble-based models using a real-world dataset.</p>
        <p>The proposed model can be embedded in existing Learning Management System (LMS), that will
assist the teaching staff to focus more on “flagged” students. This will allow the LMS to proactively
“infer” using the data features mentioned before to predict a student’s grade before they have
participated. We expect that the results obtained from this analysis will assist to identify learning needs
and learners’ performance. Learners can be supported with a variety of multiple learning material
representations targeted to specific learning needs. This approach is essential when students are learning
new problem domains, abstract concepts or new theories that may include dynamic processes for
learning. This conjunction of machine learning and student’s demographic and class participation data
contributes to LA. Since majority of education institutes are relying more and more on digital education,
thus, creating a multitude of data that is not usually analyzed or processed for various reasons. LA can
assist in not only identify student’s performance but also assist in evaluating a course’s performance to
better understand the learning implications in a more elaborated manner.</p>
      </sec>
      <sec id="sec-8-2">
        <title>6. Conclusion</title>
        <p>Academic learning performance is a major problem for many academic institutions and universities,
and if not addressed appropriately, it may cause substantial distress, poor academic performance, and
increased dropout rates. Particularly, in terms of providing educational frameworks aligned with
delivering learning resources and improving student’s academic performance looking at the problem
from multiple angles and in a multidimensional manner. By using an ensemble classifier, a computable
training model using students’ dataset was identified. In this manner, learning competencies are first
determined and subsequently optimized. The data used contain hidden information that could be used
to determine the steps for a student’s academic achievement. In this paper, a new performance
prediction model for a binary combinatorial optimization problem based on learned base classifiers is
provided. Further research will be conducted in the future to employ more assessment methodologies
to explore the links between different features. Also, to determine which characteristics are more
important than others in influencing a student's overall academic achievement. Further research may be
conducted to investigate patterns in other educational systems, which will aid in the improvement of
the LMS.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Sekeroglu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimililer</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Tuncal</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <year>2019</year>
          .
          <article-title>"Student Performance prediction and Classification Using Machine Learning Algorithms,"</article-title>
          <source>in Proceedings of the 2019 8th International Conference on Educational and Information Technology</source>
          . Cambridge, UK. Retrieve from https://dl-acmorg.ezproxy.une.edu.au/doi/abs/10.1145/3318396.3318419
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Herdlein</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riefler</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Mrowka</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <year>2013</year>
          .
          <article-title>"An Integrative Literature Review of Student Affairs Competencies: A Meta-Analysis,"</article-title>
          <source>Journal of Student Affairs Research and Practice (50:3)</source>
          , pp.
          <fpage>250</fpage>
          -
          <lpage>269</lpage>
          . doi:
          <volume>10</volume>
          .1515/jsarp-2013
          <source>-0019</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Litster</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <year>2011</year>
          .
          <article-title>"The Self‐Concepts and Perceived Competencies of Gifted and Non‐Gifted Students: A Meta‐Analysis,"</article-title>
          <source>Journal of Research in Special Educational Needs (11:2)</source>
          , pp.
          <fpage>130</fpage>
          -
          <lpage>140</lpage>
          . doi:
          <volume>10</volume>
          .1111/j.1471-
          <fpage>3802</fpage>
          .
          <year>2010</year>
          .
          <volume>01166</volume>
          .x
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Aishwarya</surname>
            ,
            <given-names>KL.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amuthan</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Anjum</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bindu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , and Iranna,
          <string-name>
            <surname>SA</surname>
          </string-name>
          .
          <year>2021</year>
          ,
          <article-title>Aug. "Prediction of Student's Performance Based on Machine Learning, "</article-title>
          <source>in Journal of Research Proceedings (1:2)</source>
          , pp.
          <fpage>226</fpage>
          -
          <lpage>232</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Bharara</surname>
            ,
            <given-names>S</given-names>
          </string-name>
          , Sabitha,
          <string-name>
            <surname>S</surname>
          </string-name>
          &amp; Bansal,
          <string-name>
            <surname>A</surname>
          </string-name>
          <year>2018</year>
          ,
          <article-title>'Application of learning analytics using clustering data Mining for Students' disposition analysis'</article-title>
          ,
          <source>Education and Information Technologies</source>
          , vol.
          <volume>23</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>957</fpage>
          -
          <lpage>984</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Anderson</surname>
            ,
            <given-names>J. R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Gluck</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <year>2001</year>
          .
          <article-title>"What Role Do Cognitive Architectures Play in Intelligent Tutoring Systems,"</article-title>
          <source>Cognition &amp; Instruction: Twenty-five years of progress)</source>
          , pp.
          <fpage>227</fpage>
          -
          <lpage>262</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Lewis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Milson</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Anderson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <year>1988</year>
          .
          <article-title>"Designing an Intelligent Authoring System for High School Mathematics Icai: The Teacher's Apprentice Project," Artificial intelligence and instruction: Applications and methods</article-title>
          . New York: Addison-Wesley).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Deejring</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <year>2014</year>
          .
          <article-title>"The Design of Web-Based Learning Model Using Collaborative Learning Techniques and a Scaffolding System to Enhance Learners' Competency in Higher Education,"</article-title>
          <source>Procedia-Social and Behavioral Sciences (116)</source>
          , pp.
          <fpage>436</fpage>
          -
          <lpage>441</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.sbspro.
          <year>2014</year>
          .
          <volume>01</volume>
          .236
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Johnson</surname>
            ,
            <given-names>D. W.</given-names>
          </string-name>
          , and Johnson, R. T.
          <year>2004</year>
          .
          <article-title>"Cooperation and the Use of Technology,"</article-title>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Anaya</surname>
            ,
            <given-names>A. R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Boticario</surname>
            ,
            <given-names>J. G.</given-names>
          </string-name>
          <year>2011</year>
          .
          <article-title>"Application of Machine Learning Techniques to Analyse Student Interactions and Improve the Collaboration Process,"</article-title>
          <source>Expert Systems with Applications (38:2)</source>
          , pp.
          <fpage>1171</fpage>
          -
          <lpage>1181</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.eswa.
          <year>2010</year>
          .
          <volume>05</volume>
          .010
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Weimer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <year>2010</year>
          .
          <article-title>"Machine Teaching--a Machine Learning Approach to Technology Enhanced Learning." Technische Universität</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , L., and
          <string-name>
            <surname>Suganthan</surname>
            ,
            <given-names>P. N.</given-names>
          </string-name>
          <year>2016</year>
          .
          <article-title>"Ensemble Classification and Regression-Recent Developments, Applications and Future Directions,"</article-title>
          <source>IEEE Computational Intelligence Magazine (11:1)</source>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>53</lpage>
          . doi:
          <volume>10</volume>
          .1109/
          <string-name>
            <surname>MCI</surname>
          </string-name>
          .
          <year>2015</year>
          .2471235
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Suganthan</surname>
            ,
            <given-names>P. N.</given-names>
          </string-name>
          <year>2017</year>
          .
          <article-title>"Benchmarking Ensemble Classifiers with Novel Co-Trained Kernal Ridge Regression</article-title>
          and Random Vector Functional Link Ensembles [Research Frontier],
          <source>" IEEE Computational Intelligence Magazine (12:4)</source>
          , pp.
          <fpage>61</fpage>
          -
          <lpage>72</lpage>
          . doi:
          <volume>10</volume>
          .1109/
          <string-name>
            <surname>MCI</surname>
          </string-name>
          .
          <year>2017</year>
          .2742867
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Bryll</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gutierrez-Osuna</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Quek</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <year>2003</year>
          .
          <article-title>"Attribute Bagging: Improving Accuracy of Classifier Ensembles by Using Random Feature Subsets,"</article-title>
          <source>Pattern Recognition (36:6)</source>
          , pp.
          <fpage>1291</fpage>
          -
          <lpage>1302</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Freund</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Schapire</surname>
            ,
            <given-names>R. E.</given-names>
          </string-name>
          <year>1996</year>
          .
          <article-title>"Experiments with a New Boosting Algorithm,"</article-title>
          <source>International Conference on Machine Learning</source>
          , pp.
          <fpage>148</fpage>
          -
          <lpage>156</lpage>
          . doi:
          <volume>10</volume>
          .5555/3091696.3091715
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Amrieh</surname>
            ,
            <given-names>E.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hamtini</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Aljarah</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <year>2016</year>
          .
          <article-title>"Mining educational data to predict student's academic performance using ensemble methods,"</article-title>
          <source>International Journal of Database Theory and Application</source>
          ,
          <volume>9</volume>
          (
          <issue>8</issue>
          ), pp.
          <fpage>119</fpage>
          -
          <lpage>136</lpage>
          . doi:
          <volume>10</volume>
          .14257/ijdta.
          <year>2016</year>
          .
          <volume>9</volume>
          .8.
          <fpage>13</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Kotsiantis</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pierrakeas</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pintelas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <year>2004</year>
          . “
          <article-title>Predicting Students' Performance in Distance Learning Using Machine Learning Techniques</article-title>
          ,
          <source>” Applied Artificial Intelligence (18:5)</source>
          , pp.
          <fpage>411</fpage>
          -
          <lpage>426</lpage>
          . doi:
          <volume>10</volume>
          .1080/08839510490442058
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Livieris</surname>
            ,
            <given-names>I.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drakopoulou</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pintelas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <year>2012</year>
          . “
          <article-title>Predicting students' performance using artificial neural networks</article-title>
          ,
          <source>” in Proceedings of the 8th Pan-Hellenic Conference of Information and Communication Technology in Education. Doi: 10</source>
          .14257/ijhit.
          <year>2015</year>
          .
          <volume>8</volume>
          .2.
          <fpage>20</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Buenaño-Fernández</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Gil</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Lujan-Mora</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <year>2019</year>
          . “
          <article-title>Application of Machine Learning in Predicting Performance for Computer Engineering Students: A Case Study</article-title>
          ,”
          <source>Sustainability (11:10)</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>18</lpage>
          . doi: doi.org/10.3390/su11102833
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Pojon</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <year>2017</year>
          .
          <article-title>“Using machine learning to predict student performance</article-title>
          ,” MS thesis, University of Tampere,
          <source>Faculty of Natural Sciences</source>
          ,
          <volume>35</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Khan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Al Sadiri,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. R.</given-names>
            and
            <surname>Jabeur</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <year>2019</year>
          . “
          <article-title>Tracking student performance in introductory programming by means of machine learning</article-title>
          ,
          <source>” in 4th MEC International Conference on Big Data and Smart City (ICBDSC)</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICBDSC.
          <year>2019</year>
          .8645608
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Domingos</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Pazzani</surname>
          </string-name>
          .
          <year>1997</year>
          . “
          <article-title>On the optimality of the simple Bayesian classifier under zero-one loss</article-title>
          ,
          <source>” Machine Learning (29)</source>
          , pp.
          <fpage>103</fpage>
          -
          <lpage>130</lpage>
          . doi:
          <volume>10</volume>
          .1023/A:1007413511361
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Aha</surname>
            ,
            <given-names>D.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kibler</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Albert</surname>
            ,
            <given-names>M.K.</given-names>
          </string-name>
          <year>1991</year>
          .
          <article-title>“Instance-Based Learning Algorithms</article-title>
          ,
          <source>” Machine Learning (6)</source>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>66</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Simpson</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <year>2006</year>
          . “
          <article-title>Predicting student success in open and distance learning,”</article-title>
          <source>The Journal of Open, Distance and e-Learning (21:2)</source>
          , pp.
          <fpage>125</fpage>
          -
          <lpage>138</lpage>
          . doi:
          <volume>10</volume>
          .1080/02680510600713110
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Pang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Judd</surname>
          </string-name>
          , N.,
          <string-name>
            <surname>O'Brien</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ben-Avie</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <year>2017</year>
          . “
          <article-title>Predicting students' graduation outcomes through support vector machines,” Frontiers in Education (FIE) Conference</article-title>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          . doi:
          <volume>10</volume>
          .1109/FIE.
          <year>2017</year>
          .8190666
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Cortez</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <year>2008</year>
          . “
          <article-title>Using Data Mining to Predict Secondary School Student Performance,”</article-title>
          <source>in 15th European Concurrent Engineering Conference</source>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Alqurashi</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <year>2019</year>
          ). “Clustering ensemble method,”
          <source>International Journal of Machine Learning and Cybernetics (10:6)</source>
          , pp.
          <fpage>1227</fpage>
          -
          <lpage>1246</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Jan</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Munoz</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ali</surname>
          </string-name>
          , Asim.
          <year>2020</year>
          .
          <article-title>“ A novel method for creating an optimized ensemble classifier by introducing cluster size reduction and diversity</article-title>
          ,
          <source>” IEEE Transactions on Knowledge and Data Engineering</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          . doi:
          <volume>10</volume>
          .1109/TKDE.
          <year>2020</year>
          .3025173
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Asafuddoula</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verma</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <year>2017</year>
          , May.
          <article-title>"An incremental ensemble classifier learning by means of a rule-based accuracy and diversity comparison,"</article-title>
          <source>In 2017 International Joint Conference on Neural Networks (IJCNN)</source>
          , pp.
          <fpage>1924</fpage>
          -
          <lpage>1931</lpage>
          . doi:
          <volume>10</volume>
          .1109/IJCNN.
          <year>2017</year>
          .7966086
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>