<!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 />
    <article-meta>
      <title-group>
        <article-title>Intelligently Raising Academic Performance Alerts</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dimitris Kalles</string-name>
          <email>dkalles@acm.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christos Pierrakeas</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michalis Xenos</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>All authors are with Hellenic Open University</institution>
        </aff>
      </contrib-group>
      <fpage>37</fpage>
      <lpage>42</lpage>
      <abstract>
        <p>We use decision trees and genetic algorithms to analyze the academic performance of students and the homogeneity of tutoring teams in the undergraduate program on Informatics at the Hellenic Open University (HOU). Based on the accuracy of the generated rules, we examine the applicability of the techniques at large and reflect on how one can deploy such techniques in academic performance alert systems.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>Student success is a natural performance indicator in
universities. However, if that success is used as a criterion for
tutor assessment (and subsequent possible contract renewal), and
if students must evaluate their own teachers, then tutors may tend
to lax their standards. This paper is about dealing with this issue
in the context of the Hellenic Open University (HOU); we focus
on the undergraduate Informatics program (about 2,500
students). We ask whether we can detect regularities in distance
tutoring, then, we try to associate them with measures of
students’ success in an objective way and, subsequently, reflect
on how to effectively disseminate this information to all
interested parties.</p>
      <p>The measurement strategy we have developed to-date in HOU
has been progressively refined to deal with two closely linked
problems: that of predicting student success in the final exams
and that of analyzing whether some specific tutoring practices
have any effect on the performance of students. Each problem
gives rise to the emergence of a different type of user model. A
student model allows us, in principle, to explain and maybe
predict why some students fail in the exams while others
succeed. A tutor model allows us to infer the extent to which a
group of tutors diffuses its collective capacity effectively into the
student population they advise. However, both types of models
can be subsequently interpreted in terms of the effectiveness of
the educational system that the university implements.</p>
      <p>The rest of this paper is organised in five sections. The next
section presents the educational background. Section 3 then
reviews the fundamental features of the AI techniques that we
have used. Following that we report the experimental results for
the undergraduate programme that we have analysed, as well as a
short evaluation of the individual module results that seem to
signify an interesting deviation. Section 5 presents a discussion
from the point of view of how one can generalise our approach
as well as how one can substitute other intelligent techniques for
data analysis; finally we conclude and describe directions for
future development.
2</p>
    </sec>
    <sec id="sec-2">
      <title>THE EDUCATIONAL BACKGROUND</title>
      <p>A module is the basic educational unit at HOU. It runs for
about ten months and is the equivalent of about 3-4
conventional university semester courses. A student may
register with up to three modules per year. For each module,
a student is expected to attend five plenary class meetings
throughout the academic year. A typical class contains about
thirty students and is assigned to a tutor (tutors of classes of
the same module collaborate on various course aspects).
Class face-to-face meetings are about four hours long and are
structured along tutor presentations, group-work and review
of homework. Furthermore, each student must turn in some
written assignments (typically four or six), which contribute
towards the final grade, before sitting a written exam. That
exam is delivered in two stages: you only need sit the second
if you fail or miss the first.</p>
      <p>Students fail a module and may not sit the written exam if
they do not achieve a pass grade in the assignments they turn
in; these students must repeat that module afresh. A student
who only fails the written exam may sit it on the following
academic year (without having to turn in assignments); such
“virtual” students are also assigned to student groups but the
tutor is only responsible for marking their exam papers.
3</p>
    </sec>
    <sec id="sec-3">
      <title>GENETIC ALGORITHMS AND</title>
    </sec>
    <sec id="sec-4">
      <title>DECISION TREES FOR PREDICTION</title>
      <p>
        In our work we have relied on decision trees to produce
performance models. Decision trees can be considered as rule
representations that, besides being accurate, can produce
comprehensible output, which can be also evaluated from a
qualitative point of view [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. In a decision tree nodes
contain test attributes and leaves contain class descriptors.
      </p>
      <p>A decision tree for the (student) exam success analysis
problem could look like the one in Figure 1 and tells us that a
mediocre grade at the second assignment (root) is an
indicator of possible failure (left branch) at the exams,
whereas a non-mediocre grade refers the alert to the fourth
(last) assignment.</p>
      <p>Decision trees are usually produced by analyzing the
structure of examples (training instances), which are given in
a tabular form. An excerpt of a training set that could have
produced such a tree is shown in Table 1. Note that the three
examples shown are consistent with the decision tree. As this
may not always be the case, there rises the need to measure
accuracy, even on the training set, in order to compare the
quality of two decision trees which offer competing
explanations for the same data set.
FAIL</p>
      <p>Assgn4 &lt; 3
FAIL</p>
      <p>PASS</p>
      <p>Note that the sample decision tree does not utilize data neither
on the first nor the third assignments, but such data is shown in
the associated table. Such dimensionality reduction information
is typical of why decision trees are useful; if we consistently
derive trees on some problem that seem to not use some data
column, we feel quite safe to not collect measurements for that
data column. Of course, simple correlation could also deliver
such information, however it is the visual representation
advantages of decision trees that have rendered them as very
popular data analysis tools.</p>
      <p>Analyzing the performance of high-risk students is a goal
towards achieving tutoring excellence. It is, thus, reasonable to
assert that predicting a student’s performance can enable a tutor
to take early remedial measures by providing more focused
coaching, especially in issues such as priority setting and time
management.</p>
      <p>
        Initial experimentation at HOU [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] consisted of using several
machine learning techniques to predict student performance with
reference to the final examination. The scope of the
experimentation was to investigate the effectiveness and
efficiency of machine learning techniques in such a context. The
WEKA toolkit [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] was used because it supports a diverse
collection of techniques. The key result was that learning
algorithms could enable tutors to predict student performance
with satisfying accuracy long before final examination. The key
finding that lead to that result was that success in the initial
written assignments is a strong indicator of success in the
examination. Furthermore, our tutoring experience corroborates
that finding.
      </p>
      <p>
        We then employed the GATREE system [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] as the tool of
choice for our experiments, to progressively set and test
hypotheses of increasing complexity based on the data sets that
were available from the university registry. The formation and
development of these tests is the core content of this chapter and
is presented and discussed in detail in the following sections.
GATREE is a decision tree builder that employs genetic
algorithms to evolve populations of decision trees; it was
eventually used because it produces short comprehensible trees.
      </p>
      <p>
        Of course, GATREE was first used [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to confirm the
qualitative validity of the original findings experiments [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ],
also serving as result replication, before advancing to more
elaborate experiments [
        <xref ref-type="bibr" rid="ref7 ref8 ref9">7, 8, 9</xref>
        ].
      </p>
      <p>
        GATREE [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] evolves populations of trees according to a
fitness function that allows for fine-tuning decision tree size
vs. accuracy on the training set. At each generation, a certain
population of decision trees is generated and sorted
according to fitness. Based on that ordering, certain genetic
operators are performed on some members of the population
to produce a new population. For example, a mutation may
modify the test attribute at a node or the class label at a leaf,
while a cross-over may exchange parts between decision
trees.
      </p>
      <p>The fitness function is fitnessi=Correcti2*x/(sizei2+x), for
tree i. The first part of the product is the actual number of
training instances that i classifies correctly. The second part
of the product (the size factor) includes a factor x which
regulates the relative contribution of the tree size into the
overall fitness; thus, the payoff is greater for smaller trees</p>
      <p>When using GATREE, we used the default settings for the
genetic algorithm operations and set cross-over probability at
0.99 and mutation probability at 0.01. Moreover, all but the
simplest experiments (explicitly so identified in the following
sections) were carried out using 10-fold cross-validation, on
which all averages are based (i.e. one-tenth of the training set
was reserved for testing purposes and the model was built by
training on the remaining nine-tenths; furthermore, ten such
stages were carried out by rotating the testing one-tenth.
4</p>
    </sec>
    <sec id="sec-5">
      <title>DATA ANALYSIS AT A PROGRAMME</title>
    </sec>
    <sec id="sec-6">
      <title>LEVEL</title>
      <p>Before advancing, we first review some aggregate statistics of
the undergraduate informatics programme at HOU.</p>
      <p>First, Table 2 presents the success rates for the modules
that we have analysed.</p>
      <p>The above statistics are all drawn from the university registry
and none is subject to any further processing. However, all
results presented from now on, refer to experiments carried out
totally using the GATREE system, with the occasional help of
some post-processing automation scripts.
4.1</p>
    </sec>
    <sec id="sec-7">
      <title>Detecting a shift in exam grades</title>
      <p>There is a straightforward way to attempt to answer this
question. One can build a model that attempts to answer the
success question for the first stage of the final exam. Then, one
can build a model that attempts to answer the success question
for the overall student grade. A gross disparity in these numbers
should be indicative of an issue that merits investigation.</p>
      <p>The simplest data to consider as input for this problem
consists of exercise and exam grades, as in Table 1, omitting any
other information (for example, which tutor was responsible for
a student). The results reported are based on re-classification (we
reserve a cross-validation like mechanism for the more detailed
experiments later on) and are shown in Table 4.</p>
      <p>What does a difference signify? To answer that, one can take
a step backwards and try to answer a simpler question: what does
a large difference signify? We have elected to brand a difference
as large when the re-classification accuracy of the same module
for the same year differs by at least 20 percentage points when
we compare the model predicting the pass/fail result of the first
stage of the final exam and the corresponding model after a
possible second stage (which is the actual pass/fail grade for the
module). In Table 4 such differences are shown in bold.</p>
      <p>There are two issues that become apparent when one views
Table 4. The first is that whenever we observe an increase in the
model accuracy when switching from the first exam (E) to the
final grade (F), this is associated with senior modules where
eventual success rates (see Table 2) are substantial. The only
decrease is observed in a junior year module where success rates
are considerably reduced compared to senior year modules.</p>
      <p>It is straightforward to attribute the increase in senior year
modules to the fact that, eventually, students have to focus on
their exam and pass the test, regardless of how well they did
along the year. The large discrepancy, however, suggests that
the exercises do not serve well their goal, which is to keep the
students engaged in the learning process. One could say that
exercises are less of learning opportunities and more of
necessary evils.</p>
      <p>The dramatic decrease in the 2006-7 year results of the
INF20 module are quite interesting. They reflect, basically, a
huge fail rate in the first stage of the exam, which is well
served by a small model that predicts failure all around.</p>
      <p>When seen from that viewpoint, however, the relatively
narrow margins of the junior year modules seem quite
impressive, since they are also associated with low overall
pass rates. The difference, however, is that the junior modules
also report significant dropout rates which skews
pessimistically the rates reported in Table 2.
4.2</p>
    </sec>
    <sec id="sec-8">
      <title>Detecting tutor influence</title>
      <p>If we take the data sets that were used in section 4.1 and put
back in the information on which tutor was responsible for
each student group, we can run the same experiments and try
to see whether the tutor attribute will surface in some models
(sample data are shown in Table 5).</p>
      <p>In principle, observing models where the tutor attribute
appears near the decision tree root would not be a good thing,
suggesting that a crucial factor in student success is not the
educational system itself but the tutor. As a matter of fact we
can opt to not look for this information at all in the resulting
trees; comparing the accuracies to the ones reported in Table
4 should suffice. These results are now shown in Table 6.
642
925
420
383
321
73
221
199
144
58
132
109
...
4.6
9.1
...
...
...</p>
      <p>...</p>
      <p>This time we observe that the relative difference between the
models which utilise the tutor attribute and the ones that do not
are quite small. There are some very interesting cases, however.</p>
      <p>For example, the INF11 module demonstrates near zero
differences throughout. It is interesting to note that this module
utilizes a plenary exam marking session, which means that tutors
get to mark exam papers drawn from all groups at random. This
places only marginal administrative overhead and, when viewed
from the point of model consistency, seems to be well worth it.</p>
      <p>Another example is the INF31 module (shown in bold),
which demonstrated a year where the tutor attribute seemed to be
of paramount importance. In that year, the gap between the first
exam stage and the final grade seems to be influenced by the
tutors. It is now very narrow (89 to 91) while it was quite wide
(68 to 91). This could suggest a relative gap in tutor
homogeneity.</p>
      <p>There is one other way to view the importance of the tutor
attribute. One can derive a model for one module group and then
attempt to use that model as a predictor of performance for the
other module groups (within the same module). This approach,
while suppressing the tutor attribute, essentially tests its
importance by specifically segmenting the module data set along
groups. The overall accuracy is then averaged over all individual
tests. This is the lesion comparison; its results are shown in
Table 7.</p>
      <p>We highlight (in bold) the main difference from the results in
Table 4, where it now seems that the gap has been shortened a
while. Surprisingly, it suggests an erratic intra-group
consistency. Note also, that this particular result in Table 4 was
the only one not to pass the binary choice (50%) level, which it
only just did in Table 6.</p>
      <p>INF10
INF11
INF12
INF20
INF21
INF22
INF23
INF24
INF30
INF31
INF35
INF37
INF42</p>
      <p>E
78
70
71
70
79
57
62
70
63</p>
      <p>N/A
N/A
N/A
N/A</p>
      <p>F
78
74
68
65
68
74
70
82
91</p>
      <p>E
75
72
77
72
69
61
65
66
64
79
66
95</p>
      <p>N/A</p>
      <p>F
75
75
69
60
65
68
74
69
84
91
97
98</p>
      <p>E
77
71
75
82
69
60
83
63
65
59
72
91
93</p>
      <p>F
77
74
71
61
64
65
98
66
89
83
91
95
100</p>
      <p>Furthermore, we tried to summarise the results from a
further point of view: that of consistency between the results
reported for the E and F columns of both tables. Essentially
we computed the quantity (F5-E5)-(F6-E6) for each module
for each year, where the subscript indicates which table that
particular number was drawn from. Not surprisingly, the two
singularities observed were module INF23 for year 2005-6
(with a value of about 20%) and module INF31 for year
2006-7 (with a value of about -22%).
4.3</p>
    </sec>
    <sec id="sec-9">
      <title>Observing the accuracy-size trade-off</title>
      <p>It is interesting to investigate whether the conventional
wisdom on model characteristics is valid. In particular, we
analysed the results in Table 6 and in Table 7 with respect to
whether an increase (or decrease, accordingly) in model
accuracy for a particular module for a year was associated
with a reduction in model size. We say that the model
accuracy increases if the accuracy for the E column of that
year is less that the corresponding number in the F column.
For the 68 pairs of numbers reported in Table 6 and in Table
7 we observed that only in 4 of them did we see the same
direction in model accuracy and model size. So, conventional
wisdom was confirmed in nearly 95% of the cases.
5</p>
      <sec id="sec-9-1">
        <title>DISCUSSION</title>
        <p>HOU has been the first university in Greece to operate, from
its very first year, a comprehensive assessment scheme (on
tutoring and administrative services). Despite a rather hostile
political environment (at least in Greece), quite a few
academic departments have lately been moving along the
direction of introducing such schemes, though the practice
has yet to be adapted at a university level. Still, however,
there is quite a mentality shift required when considering the
subtle differences between “measuring” and “assessing”.</p>
        <p>The act of measuring introduces some error in what is
being measured. If indices are interpreted as assessment
indices, then people (actually, any “assessed” subject where
people are involved – groups of people, for example) will
gradually skew their behaviour towards achieving good
measurements. Such behaviour is quite predictably human, of
course; the problem is that it simply educates people in the ropes
of the measurement system while sidelining the real issue of
improving the educational service.</p>
        <p>By shifting measurement to quantities that are difficult to
“tweak”, one hopes that people whose performance is assessed
will gradually shift form fine-tuning their short-term behaviour
toward achieving longer-term goals. Indeed, if people find out
that the marginal gains from fine-tuning their behaviour are too
small for the effort expended to achieve them, it will be easier to
convince them to improve more fundamental attitudes towards
tutoring (as far as tutors are concerned) or studying (as far as
students are concerned).</p>
        <p>In our application, this is demonstrated two-fold.</p>
        <p>First, by disseminating tutor group homogeneity indices, one
hopes that, regardless how we call these indices, these tutor
groups will be motivated by peer pressure to consider their
performance vis-a-vis other tutor groups. Even if that may not be
really required, that introspection itself will quite likely improve
how hat particular tutor group co-operates; at least it will focus
their decisions with respect to why such decisions might
influence their overall ranking.</p>
        <p>For students, a similar argument applies. Realising that one
fits a model which predicts likely failure, even if one knows that
the particular model is known to err quite some times, is
something that will most likely motivate that person to take a
more decisive approach to studying. For adult students, such a
decisive approach might even mean to drop a course of studying
or defer studying. This is not necessarily negative, however;
knowing how to better utilise one’s resources is a key skill in life
long learning.</p>
        <p>
          We have selected decision trees because we want to generate
models that can be effectively communicated to tutors and
students alike. We have also selected genetic algorithms to
induce the decision trees because we have shown [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] that, for the
particular application domain, we can derive small and easy to
communicate yet accurate trees. We thus need a hybrid
approach: rule-based output to be comprehensible and grounded
and evolutionary computing to derive this output.
        </p>
        <p>Which other techniques should one utilise to develop the
models? We cannot fail to note that conventional statistics can
be cumbersome to disseminate to people with a background on
humanities or arts, and this could have an adverse impact on the
user acceptance of such systems. In that sense, the decision of
whether the models are computed centrally or in a decentralized
fashion (by devolving responsibility to the tutors, for example) is
a key factor. In any case, deploying our measurement scheme in
an organization-wide context would also lend support to our
initial preference for short models. At the same time, the
possibility of a decentralized scheme also suggests that we
should strive to use tools that do not demand a steep learning
curve on the part of the tutors.</p>
        <p>
          Of course, one can take an alternative course and drop the
requirement that a model has to be communicated. If we only
focus on the indices then any technique can be used, from neural
networks to more conventional ones, such as naive Bayes or
logistic regression [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. As in all data mining application
contexts, it is the application that must drive the techniques to
use; for our problem, suffice to note that the comparisons
reported (Table 4, Table 6 and Table 7) are essentially technique
independent, yet the GATREE approach has proven to-date to be
the best method for prototyping the measurement exercise that
we are developing.
        </p>
      </sec>
      <sec id="sec-9-2">
        <title>CONCLUSION</title>
        <p>We have shown how we have used a combination of genetic
algorithms and decision trees in the context of experimenting
with how one might setup a quality control system in an
educational context.</p>
        <p>Quality control should be a core aspect of any educational
system but setting up a system for quality control entails
managerial and administrative decisions that may also have to
deal with political side-effects. Deciding how to best and as
early as possible defuse the potential stand-offs that a quality
measurement message might trigger calls for the employment
of techniques that not only ensure a basic technical soundness
in the actual measurement but also cater to the way the results
are conveyed and subsequently exploited. This is particularly
so when the application context for the large scale suggests
that data and models will freely flow amongst thousands of
tutors and tens of thousands of students.</p>
        <p>
          We have earlier [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] expressed the view that our approach
is applicable to any educational setting where performance
measurement can be cast in terms of test (and exam)
performance. In the proposed paper we have scaled up our
analysis to cover several modules and years and still believe
that taking the sting out of individual performance evaluation
but still being able to convey the full message is a key
component of tutoring self-improvement. Scaling our
approach to other programmes, other institutions and, even,
obtaining the approval of our own university for official and
consistent reporting of such indices is, however, less of a
technical nature and more of a political exercise. After all we
need to persuade people that some innovations are less of a
threat and more of an opportunity.
        </p>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>ACKNOWLEDGEMENTS</title>
      <p>Thanassis Hadzilacos (now at the Open University of Cyprus)
has contributed to this line of research while at Hellenic Open
University.</p>
      <p>Anonymized data can be available on request for research
purposes only, on a case-by-case basis.</p>
      <p>We acknowledge the advice, from an anonymous reviewer
of the CIMA-ECAI08 workshop, on how to improve the
presentation of this work to reflect the combination of AI
techniques used.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1] Mitchell,
          <string-name>
            <surname>T.</surname>
          </string-name>
          (
          <year>1997</year>
          ).
          <article-title>Machine Learning</article-title>
          .
          <source>McGraw Hill.</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Quinlan</surname>
            ,
            <given-names>J.R</given-names>
          </string-name>
          (
          <year>1993</year>
          ).
          <year>C4</year>
          .
          <article-title>5: Programs for machine learning</article-title>
          . San Mateo, CA: Morgan Kaufmann.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Kalles</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Ch</surname>
          </string-name>
          .
          <string-name>
            <surname>Pierrakeas</surname>
          </string-name>
          (
          <year>2006</year>
          ).
          <article-title>Analyzing student performance in distance learning with genetic algorithms and decision trees</article-title>
          .
          <source>Applied Artificial Intelligence</source>
          ,
          <volume>20</volume>
          (
          <issue>8</issue>
          ), pp.
          <fpage>655</fpage>
          -
          <lpage>674</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Kotsiantis</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pierrakeas</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , &amp;
          <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</source>
          ,
          <volume>18</volume>
          :
          <fpage>5</fpage>
          ,
          <fpage>411</fpage>
          -
          <lpage>426</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Frank</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          (
          <year>2000</year>
          ).
          <article-title>Data mining: practical machine learning tools and techniques with Java implementations</article-title>
          . San Mateo, CA: Morgan Kaufmann.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Papagelis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , &amp; D.
          <string-name>
            <surname>Kalles</surname>
          </string-name>
          (
          <year>2001</year>
          ).
          <article-title>Breeding decision trees using evolutionary techniques</article-title>
          .
          <source>Proceedings of the International Conference on Machine Learning</source>
          , Williamstown, Massachusetts, pp.
          <fpage>393</fpage>
          -
          <lpage>400</lpage>
          , Morgan Kaufmann.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Kalles</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Ch</surname>
          </string-name>
          . Pierrakeas. (
          <year>2006</year>
          ).
          <article-title>Using Genetic Algorithms and Decision Trees for a posteriori Analysis and Evaluation of Tutoring Practices based on Student Failure Models</article-title>
          .
          <source>Proceedings of the 3rd IFIP conference on Artificial Intelligence Applications and Innovations</source>
          , Athens, Greece, pp.
          <fpage>9</fpage>
          -
          <lpage>18</lpage>
          , Springer.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Hadzilacos</surname>
            ,
            <given-names>Th.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalles</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Pierrakeas</surname>
          </string-name>
          , Ch., &amp; M.
          <string-name>
            <surname>Xenos</surname>
          </string-name>
          (
          <year>2006</year>
          ).
          <article-title>On Small Data Sets Revealing Big Differences</article-title>
          .
          <source>Proceedings of the 4th Panhellenic conference on Artificial Intelligence</source>
          , Heraklion, Greece, Springer LNCS 3955, pp.
          <fpage>512</fpage>
          -
          <lpage>515</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Hadzilacos</surname>
            ,
            <given-names>Th.</given-names>
          </string-name>
          , &amp; D.
          <string-name>
            <surname>Kalles</surname>
          </string-name>
          (
          <year>2006</year>
          ).
          <article-title>On the Software Engineering Aspects of Educational Intelligence</article-title>
          .
          <source>Proceedings of the 10th International Conference on Knowledge-Based Intelligent Information &amp; Engineering Systems</source>
          , Bournemouth, UK, Springer LNCS 4252, pp.
          <fpage>1136</fpage>
          -
          <lpage>1143</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Xenos</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pierrakeas</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Pintelas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2002</year>
          ).
          <article-title>A survey on student dropout rates and dropout causes concerning the students in the Course of Informatics of the Hellenic Open University</article-title>
          . Computers &amp; Education,
          <volume>39</volume>
          ,
          <fpage>361</fpage>
          -
          <lpage>377</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>