<!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>Recognising Perceived Task Difficulty from Speech and Pause Histograms</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ruth Janning</string-name>
          <email>janning@ismll.uni-hildesheim.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Carlotta Schatten</string-name>
          <email>schatten@ismll.uni-hildesheim.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lars Schmidt-Thieme</string-name>
          <email>schmidt-thieme@ismll.uni-hildesheim.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Currently, a lot of research in the field of intelligent tutoring systems is concerned with recognising student's emotions and affects. The recognition is done by extracting features from information sources like speech, typing and mouse clicking behaviour or physiological sensors. In former work we proposed some low-level speech features for perceived task difficulty recognition in intelligent tutoring systems. However, by extracting these features some information hidden in the speech input is loosed. Hence, in this paper we propose and investigate speech and pause histograms as features, which preserve some of the loosed information. The approach of using speech and pause histograms for perceived task difficulty recognition is evaluated by experiments on data collected in a study with German students solving mathematical tasks.</p>
      </abstract>
      <kwd-group>
        <kwd>Intelligent tutoring systems</kwd>
        <kwd>perceived task difficulty recognition</kwd>
        <kwd>low-level speech features</kwd>
        <kwd>speech and pause histograms</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Automatic cognition, affect and emotion recognition is a relatively young and
very important research field in the area of adaptive intelligent tutoring systems.
Some research has been done to identify useful information sources and
appropriate features able to describe student’s cognition, emotions and affects. Those
information sources can be speech input, written input, typing and mouse
clicking behaviour or input from physiological sensors. In former work ([
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ])
we proposed low-level speech features for perceived task difficulty recognition in
intelligent tutoring systems. These features are extracted from the amplitudes
of speech input of students interacting with the system and contain for instance
the maximal and average length of speech phases and pauses. However, by
extracting those features some more fine granulated information contained within
the sequence of speech and pause segments is loosed and the question arises if
there is a way to create features which preserve the loosed information.
Histograms contain much more information than only the maximal, minimal and
average value. Hence, in this work we propose and investigate speech and pause
histograms as features for perceived task difficulty recognition, i.e. for
recognising if a student feels over-challenged or appropriately challenged by a task.
Speech and pause histograms share the advantages of low-level speech features
(they do not inherit the error from speech recognition and there is no need that
students use words related to emotions or affects, see also sec. 2) and avoid to
lose information hidden in the sequences of speech and pause segments.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        For the purpose to recognise emotion or affect in speech one can distinct
linguistics features, like n-grams and bag-of-words, and low-level features like prosodic
features, disfluencies, e.g. speech pauses ([
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]), (see e.g. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]) or articulation
features ([
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]). If linguistics features are not extracted from written but from
spoken input, a transcription or speech recognition process has to be applied to the
speech input before emotion or affect recognition can be conducted. Linguistic
features for affect and emotion recognition from conversational cues were
presented and investigated e.g. in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Low-level features are used in the
literature for instance for expert identification, as in [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], for
emotion and affect recognition as in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] or for humour recognition as
in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. The advantage of using low-level features like disfluencies is that instead
of a full transcription or speech recognition approach only for instance a pause
identification has to be applied before computing the features. That means that
one does not inherit the error of the full speech recognition approach.
Furthermore, these features are independent from the need that students use words
related to emotions or affects. Another kind of features which is independent
from the need that students use words related to emotions or affects are features
gained from information about the actions of the students interacting with the
system (see e.g. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]) like features extracted from a log-file (see e.g. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]).
In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] such kind of features is used to predict whether a student can answer
correctly questions in an intelligent learning environment without requesting help
and whether a student’s interaction is beneficial in terms of learning. Also the
keystroke dynamics features used in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] belong to this kind of features. In [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
emotional states were identified by analysing the rhythm of the typing patterns
of persons on a keyboard. A further possibility of gaining features is using the
information from physiological sensors as for instance in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. However, bringing
sensors into classrooms is time consuming and expensive and one has to cope
with students’ acceptance of the sensors.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Speech and Pause Histograms</title>
      <p>As mentioned above, in this paper we investigate the ability of speech and pause
histograms for perceived task difficulty recognition. How these speech and pause
histograms are created from students’ speech input is described in sec. 3.2 and
the data which we used for our experiments is described in the next section.
3.1</p>
      <sec id="sec-3-1">
        <title>Data</title>
        <p>We conducted a study in which the speech and actions of ten 10 to 12 years
old German students were recorded and their perceived task-difficulties were
reported per task. The labelling of these data was done on the one hand
concurrently by a human tutor and on the other hand retrospectively by a second
reviewer (with a Cohen’s kappa for inter-rater reliability of 0.747, p &lt; 0.001).
Divergences in the both labellings were clarified later on by discussions between
the reviewers. During the study a paper sheet with fraction tasks was shown to
the students and they were asked to paint – by means of a software for painting
with a computer – their solution and they were prompt to explain aloud their
observations and answers. The fraction tasks were subdivided into similar
subtasks and covered exercises like assigning fractions to coloured parts of a circle
or rectangle, reducing, adding or subtracting fractions and fraction equivalence.
Originally, there were 10 tasks with 1 up to 10 subtasks but not each task was
seen by each student. We made a screen recording to record the painting of
the students and an acoustic recording to record the speech of the students.
The screen recordings were used for the retrospective annotation. The acoustic
speech recordings, consisting of 10 wav files with a length from 15 up to 20
minutes, were used to gain the speech and pause histograms. The data collection
resulted in 36 examples (tasks) labelled with over-challenged (12 examples) or
appropriately challenged (24 examples), respectively 48 examples (24 of class
appropriately challenged, 24 of class over-challenged ) after applying oversampling
to the smaller set of examples of class over-challenged to eliminate the unbalance
in the data.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Histograms for Classification</title>
        <p>
          In the above mentioned study we observed that the children often exhibited
longer pauses of silence while thinking about the problem when they were
overchallenged or produced fewer and shorter pauses while communicating when
they were appropriately challenged. Hence, in this paper we investigate
information about pauses and speech segments within the speech input of students
in connection with the perceived task difficulty. The first step to gain this
information is to segment the acoustic speech recordings for identifying segments
containing speech and segments corresponding to pauses. The most easy way
to do this is to define a threshold on the decibel scale as done e.g. in [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. For
our study of the data we also used a threshold, which was estimated manually.
The manual threshold estimation was done by extracting the amplitudes of the
sound files, computing the decibel values and generating a graphic of it like the
one in fig. 1. Subsequently, it was investigated which decibel values belong to
speech and which ones to pauses to create from this information an appropriate
threshold. By means of this threshold the pause and speech segments can be
extracted. From the pause segments the pause histogram is generated by
counting how often each possible pause length occur. This pause histogram is then
normalised, to make the pause histograms of different speech inputs (of different
students, different tasks and different lengths) comparable. The normalisation is
done by dividing each occurring pause length by the length of the whole speech
input as well as dividing the frequency of each occurring pause length by the
number of all speech and pause segments, so that the resulting values stem
from the interval between 0 and 1. The same is done with the speech segments
for generating the speech histogram. Examples of normalised pause histograms
and speech histograms are shown in fig. 2 and fig. 3. The examples stem from
the speech input for a task of four different students, where two were labelled as
over-challenged and the other two as appropriately challenged. One can see some
differences between the histograms of the over-challenged students and the
appropriately challenged students as well as some similarities of the examples with
the same label. The pause histograms of the appropriately challenged students
show that there are a lot of very small pauses within their speech, but no very
large pauses. The pause histograms of the over-challenged students in contrast
report long pauses and less smaller pauses than for the appropriately challenged
students. In the speech histograms one can see that the over-challenged
students used a lot of very small speech segments of the same length whereas for
appropriately challenged students there is a large variance in the speech segment
length. In the following section we investigate how these histograms can be used
for classifying the speech input of a student for a task as either over-challenged
or appropriately challenged.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiments</title>
      <p>To investigate if the above described speech and pause histograms are
applicable for distinguishing over-challenged and appropriately challenged students
we conducted experiments with the perprocessing and settings described in the
following section. The experimental results are reported in sec. 4.2.
4.1</p>
      <p>Preprocessing and Experimental Settings
To be computationally comparable the normalised histograms still need to be
preprocessed, or more explicitly generalised, as the set of possibly occurring
segment lengths is infinite (it is a real value between 0 and 1). Hence, we divide
the x-axis (the different normalised lengths of pause or speech segments) into a
number of equal sized intervals, the buckets. Each occurring normalised segment
length is then put into the bucket to whose interval it belongs. The number
of buckets, or the bucket size respectively, is a hyper parameter and in the
experiments we investigated different values for that parameter, i.e. we conducted
experiments with 2 up to 1, 000, 000 buckets (bucket size 0.5 up to 1.0E-6) where
the numbers of buckets are multiples of the numbers by which 100 is divisible
without remainder. A comparison of two different histograms can now be done
by comparing the content of each bucket in both histograms, that means that for
each bucket the normalised frequencies of segments belonging to that bucket are
compared. In our experiments we compute the difference between two histograms
by computing the differences between the frequencies in all buckets by means of
the root mean square error (RMSE):</p>
      <p>RMSE =
s</p>
      <p>
        b
Pi=1(bi(Hx) − bi(Hy))2
b
where Hx and Hy are the two histograms to compare, bi(Hx) and bi(Hy) are the
normalised frequency values belonging to bucket bi of Hx and Hy and b is the
number of buckets. For deciding to which class (over-challenged or appropriately
challenged ) a histogram belongs we applied the K-Nearest-Neighbour (KNN)
approach. KNN (see e.g. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]) classifies an example by a majority vote of its
neighbours, that is the example is assigned to the class most common among
its K nearest neighbours. These K nearest neighbours are the K closest training
examples in the feature space. The closeness in our case is measured by means
of the RMSE. That is a histogram is assigned to that class to which the majority
of the K closest (in terms of RMSE) histograms belongs. K is a further hyper
parameter and also for that parameter we tried out different values, i.e. we
conducted experiments with a number of 1 up to 35 neighbours where that value
is an odd number less than the number of unique examples. For the evaluation
we used a Leave-one-out cross-validation in the experiments. The results of our
experiments with pause and speech histograms are discussed in the next section.
pauses
pauses
0
6
)% 50
(
tseK 04
b
,
(r)% 03
o
r
r
lae 20
m
i
n
iM 01
0
0
6
)% 50
(
tseK 04
b
,
(r)% 03
o
r
r
lae 20
m
i
n
iM 01
0
)% 60
(
s
tkce 05
u
b
.fo 04
m
u
tsen 30
b
,
(r)% 02
o
r
r
lae 10
m
i
n
iM 0
)% 60
(
s
tkce 05
u
b
.fo 04
m
u
tsen 30
b
,
(r)% 02
o
r
r
lae 10
m
i
n
iM 0
      </p>
      <sec id="sec-4-1">
        <title>Min. error</title>
      </sec>
      <sec id="sec-4-2">
        <title>Best K</title>
        <p>speech</p>
      </sec>
      <sec id="sec-4-3">
        <title>Min. error</title>
      </sec>
      <sec id="sec-4-4">
        <title>Best K</title>
        <p>2 5 20 50 200 500 2500 20000 1e+05 5e+05</p>
      </sec>
      <sec id="sec-4-5">
        <title>Number of buckets</title>
        <p>Fig. 4. Different numbers of buckets and different numbers K of neighbours mapped
to the minimal classification error (%) and the belonging best value for K (% of the
number of examples) and for the number of buckets (% of the max. number of buckets)
for pause and speech histograms.</p>
      </sec>
      <sec id="sec-4-6">
        <title>Min. error</title>
      </sec>
      <sec id="sec-4-7">
        <title>Best num. buckets speech</title>
      </sec>
      <sec id="sec-4-8">
        <title>Min. error</title>
      </sec>
      <sec id="sec-4-9">
        <title>Best num. buckets</title>
        <p>4.2</p>
        <p>Experiments with Speech and Pause Histograms
As mentioned above, we conducted experiments with different numbers of
buckets and different values for the K nearest neighbours. In fig. 4 we report the
minimal classification error and the belonging best value of K for each bucket
number as well as the the minimal classification error and the belonging best
number of buckets for each value of K for the pause and the speech histograms.
The classification error is the number of incorrectly classified histograms divided
by the number of all histograms. The black dots in fig. 4 indicate the best
results which are also reported in tab. 1 and 2. As one can see in fig. 4 for the
pause histograms a smaller number of buckets delivers the best results whereas
for the speech histograms the number of buckets has to be large, i.e. a more fine
granulated division of the x-axis is needed for good results. The reason might be
that the pause histograms of over-challenged and appropriately challenged
students are easier distinguishable as in the pause histogram of an over-challenged
student there are typically long pause segments which usually do not occur in
the speech of appropriately challenged students (see also fig. 2). As fig. 3 shows,
speech histograms of over-challenged and appropriately challenged students are
not so easy to distinct. Tab. 1 and 2 show the results of the best choices for hyper
parameter K and number of buckets and reports the classification error as well as
the F-measures of both classes (over-challenged and appropriately challenged ).
The F-measure is a value between 0 and 1 and the closer it is to 1 the better.
It is the harmonic mean between the ratio of examples of a class c which are
correctly recognised as members of that class (recall ) and the ratio of examples
classified as belonging to class c which actually belong to class c (precision).
In our experiments the F-measures of class appropriately challenged are better
than those of class over-challenged. The reason could be that originally there
were more examples of class appropriately challenged and we just oversampled
class over-challenged to receive a balanced example set. Nevertheless, the best
classification errors of 25% and 27.08% and F-measures 0.67, 0.83 and 0.64, 0.77
in tab. 1 and 2 indicate that speech and pause histograms are applicable for
perceived task difficulty recognition.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>We proposed and investigated speech and pause histograms, build from the
sequences of speech and pause segments within the speech input of students, as
features for perceived task difficulty recognition. To evaluate the approach of using
the histograms for distinguishing over-challenged and appropriately challenged
students we applied a K-Nearest-Neighbour classification delivering a
classification error of 25% for pause histograms and 27.08% for speech histograms. Next
steps will be to try out other classification approaches, for instance from time
series classification. Furthermore, the information from the speech histograms and
pause histograms could be combined to reach a better classification performance,
e.g. by ensemble methods.</p>
      <p>Acknowledgements. This work is co-funded by the EU project iTalk2Learn
(www.italk2learn.eu) under grant agreement no. 318051.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Arroyo</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Woolf</surname>
            ,
            <given-names>B.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burelson</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muldner</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rai</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Tai</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A Multimedia Adaptive Tutoring System for Mathematics that Addresses Cognition, Metacognition and Affect</article-title>
          . In
          <source>International Journal of Artificial Intelligence in Education</source>
          , Springer, Vol.
          <volume>24</volume>
          , pp.
          <fpage>387</fpage>
          -
          <lpage>426</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baker</surname>
            ,
            <given-names>R.S.J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gowda</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wixon</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalka</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wagner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salvi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aleven</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kusbit</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ocumpaugh</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Rossi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Towards Sensor-Free Affect Detection in Cognitive Tutor Algebra</article-title>
          .
          <source>In Proceedings of the 5th International Conference on Educational Data Mining (EDM</source>
          <year>2012</year>
          ), pp.
          <fpage>126</fpage>
          -
          <lpage>133</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cover</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hart</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Nearest neighbor pattern classification</article-title>
          .
          <source>EEE Transactions on Information Theory</source>
          , Vol.
          <volume>13</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>21</fpage>
          -
          <lpage>27</lpage>
          , doi:10.1109/TIT.
          <year>1967</year>
          .
          <volume>1053964</volume>
          (
          <year>1967</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Epp</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lippold</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Mandryk</surname>
            ,
            <given-names>R.L.</given-names>
          </string-name>
          :
          <article-title>Identifying Emotional States Using Keystroke Dynamics</article-title>
          .
          <source>In Proceedings of the 2011 Annual Conference on Human Factors in Computing Systems (CHI</source>
          <year>2011</year>
          ), pp.
          <fpage>715</fpage>
          -
          <lpage>724</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Janning</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schatten</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidt-Thieme</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Multimodal Affect Recognition for Adaptive Intelligent Tutoring Systems</article-title>
          .
          <source>In Extended Proceedings of the 7th International Conference on Educational Data Mining (EDM</source>
          <year>2014</year>
          ), pp.
          <fpage>171</fpage>
          -
          <lpage>178</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Janning</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schatten</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidt-Thieme</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Feature Analysis for Affect Recognition Supporting Task Sequencing in Adaptive Intelligent Tutoring Systems</article-title>
          .
          <source>In Proceedings of the European Conference on Technology Enhanced Learning (ECTEL</source>
          <year>2014</year>
          ), pp.
          <fpage>179</fpage>
          -
          <lpage>192</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Janning</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schatten</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidt-Thieme</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Backfried</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>An SVM Plait for Improving Affect Recognition in Intelligent Tutoring Systems</article-title>
          .
          <source>In Proceedings of the IEEE International Conference on Tools with Artificial Intelligence (ICTAI)</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Luz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Automatic Identification of Experts and Performance Prediction in the Multimodal Math Data Corpus through Analysis of Speech Interaction</article-title>
          . Second International Workshop on Multimodal Learning Analytics, Sydney
          <string-name>
            <surname>Australia</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mavrikis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Data-driven modelling of students interactions in an ILE</article-title>
          .
          <source>In Proceedings of the International Conference on Educational Data Mining (EDM</source>
          <year>2008</year>
          ), pp.
          <fpage>87</fpage>
          -
          <lpage>96</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>DMello</surname>
            ,
            <given-names>S.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Craig</surname>
            ,
            <given-names>S.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Witherspoon</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McDaniel</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Graesser</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Automatic detection of learners affect from conversational cues. User Model User-Adap Inter</article-title>
          , DOI
          <volume>10</volume>
          .1007/s11257-007-9037-
          <fpage>6</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>D'Mello</surname>
            ,
            <given-names>S.K.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Graesser</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Language and Discourse Are Powerful Signals of Student Emotions during Tutoring</article-title>
          .
          <source>IEEE Transactions on Learning Technologies</source>
          , Vol.
          <volume>5</volume>
          (
          <issue>4</issue>
          ), pp.
          <fpage>304</fpage>
          -
          <lpage>317</lpage>
          , IEEE Computer Society (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Lai</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Word-Level Emotion Recognition Using HighLevel Features</article-title>
          .
          <source>Computational Linguistics and Intelligent Text Processing (CICLing</source>
          <year>2014</year>
          ), pp.
          <fpage>17</fpage>
          -
          <lpage>31</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Morency</surname>
            ,
            <given-names>L.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oviatt</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scherer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weibel</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Worsley</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>ICMI 2013 grand challenge workshop on multimodal learning analytics</article-title>
          .
          <source>In Proceedings of the 15th ACM on International conference on multimodal interaction (ICMI</source>
          <year>2013</year>
          ), pp.
          <fpage>373</fpage>
          -
          <lpage>378</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Pardos</surname>
            ,
            <given-names>Z.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baker</surname>
            ,
            <given-names>R.S.J.D</given-names>
          </string-name>
          , San Pedro,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Gowda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.M.</given-names>
            and
            <surname>Gowda</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.M.</surname>
          </string-name>
          :
          <article-title>Affective States and State Tests: Investigating How Affect and Engagement during the School Year Predict End-of-Year Learning Outcomes</article-title>
          .
          <source>Journal of Learning Analytics</source>
          , Vol.
          <volume>1</volume>
          (
          <issue>1</issue>
          ), Inaugural issue, pp.
          <fpage>107</fpage>
          -
          <lpage>128</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Purandare</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Litman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Humor:
          <article-title>Prosody Analysis</article-title>
          and
          <string-name>
            <given-names>Automatic</given-names>
            <surname>Recognition for F * R * I * E * N * D * S</surname>
          </string-name>
          <article-title>*</article-title>
          .
          <source>In Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (EMNLP</source>
          <year>2006</year>
          ), pp.
          <fpage>208</fpage>
          -
          <lpage>215</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. San Pedro,
          <string-name>
            <given-names>M.O.C.</given-names>
            ,
            <surname>Baker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.S.J.D.</given-names>
            ,
            <surname>Bowers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            and
            <surname>Heffernan</surname>
          </string-name>
          , N.:
          <article-title>Predicting College Enrollment from Student Interaction with an Intelligent Tutoring System in Middle School</article-title>
          .
          <source>In Proceedings of the 6th International Conference on Educational Data Mining (EDM</source>
          <year>2013</year>
          ), pp.
          <fpage>177</fpage>
          -
          <lpage>184</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Schuller</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batliner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steidl</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Seppi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Recognising realistic emotions and affect in speech: State of the art and lessons learnt from the first challenge</article-title>
          .
          <source>Speech Communication</source>
          ,
          <string-name>
            <surname>Elsevier</surname>
          </string-name>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Worsley</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Blikstein</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>What's an Expert? Using Learning Analytics to Identify Emergent Markers of Expertise through Automated Speech, Sentiment and Sketch Analysis</article-title>
          .
          <source>In Proceedings of the 4th International Conference on Educational Data Mining (EDM '11)</source>
          , pp.
          <fpage>235</fpage>
          -
          <lpage>240</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>