<!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>Student Modeling Method Integrating Knowledge Tracing and IRT with Decay Effect</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Shinichi Oeda</string-name>
          <email>oeda@j.kisarazu.ac.jp</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kouta Asai</string-name>
          <email>asai.kota@nifty.co.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Advanced Control and Information Engineering Course, National Institute of Technology, Kisarazu College</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Corporation, Human Resources Department</institution>
          ,
          <addr-line>Shinjuku Kita-shinjuku 2-chome, Shinjuku-ku, Tokyo</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Information and Computer Engineering, National Institute of Technology</institution>
          ,
          <addr-line>Kisarazu College 11-1, Kiyomidaihigashi 2-chome Kisarazu City, Chiba</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Educational data mining (EDM) involves the application of data mining, machine learning, and statistics to information generated from educational settings. Modeling students' knowledge is a fundamental part of intelligent tutoring systems. One of the most popular methods for estimating students' knowledge is knowledge tracing. It is the de-facto standard for inferring students' knowledge from performance data. The goal of this study is to estimate future student performance from massive amounts of examination results. We propose a novel method to improve the precision of student modeling using knowledge tracing with item response theory, including the decay theory of forgetting.</p>
      </abstract>
      <kwd-group>
        <kwd>Educational data mining</kwd>
        <kwd>knowledge tracing</kwd>
        <kwd>item response theory</kwd>
        <kwd>hidden Markov model</kwd>
        <kwd>decay theory</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Intelligent tutoring systems (ITS) and learning management systems (LMS) have
been widely used in the elds of education, and have allowed us to collect log
data from learners, such as students. Educational data mining (EDM) aims
at discovering useful information from the massive amounts of electronic data
collected by these educational systems. EDM is an emerging multi-disciplinary
research area where methods and techniques for exploring data originating from
various educational information systems have been developed [1].</p>
      <p>One of the goals of EDM is student modeling. It is one of the key factors
affecting automated tutoring systems in making instructional decisions. The
purpose of student modeling is the estimation of students' skills and The prediction
whether a student solve an item or not from log data such as examination results.
One of the most popular methods for estimating student knowledge is knowledge
tracing [2]. It is the de-facto standard for inferring students' knowledge from
performance data. An ITS provides efficient learning environments for students by
assigned a suitable item for a student's skill level. The ITS employs a student
model. In order to create a high-performance ITS, a student model is needed
that can predict students' answers and estimate the state of their skills.</p>
      <p>However, knowledge tracing did not consider the process of the decay theory
of forgetting, whereby human memory fades over time. Conventional methods
for knowledge tracing cannot handle the decay effect because it is difficult to
estimate the parameters of model using the forgetting process. In order to
comprehend the learning effects in the educational process, it is signi cant to study
how the distribution of students' latent skills changes over time. We address the
issue by incorporating item response theory into the decay effect. In this paper,
we propose a novel method to improve the precision of student modeling
using knowledge tracing with item response theory, including the decay theory of
forgetting.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Knowledge Tracing</title>
      <p>Knowledge Tracing was developed in 1995, and has since established its position
as a well-known method of student modeling. Figure 1 uses the plate notation to
show a graphical model of knowledge tracing. A question item in an examination
requires several skills to solve.</p>
      <p>The diagram shows that t is a learning opportunity, kt is a latent variable as
a skill state (master or not master) of the student, yt is an observation variable
as a result (correct or incorrect) of the student's response. Knowledge tracing is
represented hidden Markov model, since student's skill states are not observed
while student's results are observed.</p>
      <p>In knowledge tracing, four parameters P (L0); P (T ); P (G); P (S) for each skill
are de ned as follows:
already know
learn
guess
slip</p>
      <p>
        P (L0) d=ef P (k0 = true);
P (T ) d=ef P (kt = truejkt 1 = false);
P (G) d=ef P (yt = truejkt = false);
P (S) d=ef P (yt = falsejkt = true):
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
      </p>
      <p>There are four types of model parameters used in knowledge tracing as the
initial probability of knowing a skill a priori. P (L0) is the probability that a
student has learned how to apply a knowledge component prior to the rst
opportunity to apply it in the ITS. P (T ) is the probability of a student's knowledge
of a skill transitioning from the not known to the known state after an
opportunity to apply it. Here, knowledge tracing assumes that a student does not forget
already
know</p>
      <sec id="sec-2-1">
        <title>Student</title>
      </sec>
      <sec id="sec-2-2">
        <title>Knowledge</title>
        <p>(k0)
guess
or
slip</p>
      </sec>
      <sec id="sec-2-3">
        <title>Student</title>
      </sec>
      <sec id="sec-2-4">
        <title>Performance</title>
        <p>(y0)
learn</p>
      </sec>
      <sec id="sec-2-5">
        <title>Student</title>
      </sec>
      <sec id="sec-2-6">
        <title>Knowledge</title>
        <p>(kt)</p>
      </sec>
      <sec id="sec-2-7">
        <title>Student</title>
      </sec>
      <sec id="sec-2-8">
        <title>Performance</title>
        <p>(yt)
a mastered skill if even once. Accordingly, the probability of skill transition from
master to not master is zero. P (G) is the probability of correctly applying an
unknown skill, and P (S) is the probability of making a mistake when applying
a known skill.</p>
        <p>
          Given that parameters P (L0); P (T ); P (G); P (S) are set for all skills, the
formulae used to update student knowledge of skills are as follows, from Equation
(
          <xref ref-type="bibr" rid="ref5">5</xref>
          ) to (8), from the results of students' answers until opportunity t:
P (Lt = truejyt = true) =
P (Lt = truejyt = false) =
        </p>
        <p>P (Lt)(1</p>
        <p>P (Lt)(1 P (S))
P (S)) + (1</p>
        <p>P (Lt))P (G)</p>
        <p>P (Lt)P (S)
P (Lt)P (S) + (1 P (Lt))(1</p>
        <p>P (G))
;
;
P (Lt+1 = true) = P (Ltjyt) + (1</p>
        <p>P (Ltjyt))P (T );
P (yt+1 = true) = P (Lt+1)(1</p>
        <p>P (S)) + (1</p>
        <p>
          P (Lt+1))P (G):
(
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
(
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
(
          <xref ref-type="bibr" rid="ref7">7</xref>
          )
(8)
        </p>
        <p>
          Equations (
          <xref ref-type="bibr" rid="ref5">5</xref>
          ) and (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) update a skill state from the answer to opportunity t.
The skill state of future opportunity t + 1 is calculated by Equation (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ) by the
updated value of Equation (
          <xref ref-type="bibr" rid="ref5">5</xref>
          ) and (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ). Moreover, the probability that a student
can answer an assigned item at t + 1 is calculated using Equation (8) by the
derived value of Equation (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ).
2.1
        </p>
        <p>Estimation of parameters
In the knowledge tracing model, the four parameters P (L0); P (T ); P (G); P (S)
per skill are unknown. Although these parameters are de ned by an expert, they
are estimated by results from past data in general. We can estimate these
parameters by the Baum{Welch algorithm [3], since knowledge tracing is a hidden
Markov model.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Item Response Theory</title>
      <sec id="sec-3-1">
        <title>Overview of model</title>
        <p>IRT (item response theory) [4] is the study of examination and item scores
based on assumptions concerning the mathematical relationship between a latent
ability and item responses. The IRT model predicts the probability that a certain
student will give a certain response to a certain item. Students can have different
levels of ability, and items can differ in many respects. In IRT models, Rasch
model like a logistic function is used on the ability variable to explain examinees'
item responses as follows:</p>
        <p>Pij (y = true) =</p>
        <p>1
1 + exp( 1:7( i
j ))
;
(9)
where index i indicates a student, j indicates an item, i is the student's ability
parameter for item j, and j is the difficulty parameter of item j.</p>
        <p>Variable i is considered the ability required to perform well on question
items. The item response function gives the probability that a student with a
given ability level will answer a question correctly. Students with lower ability
have less of a chance, whereas those with higher ability are more likely to answer
correctly.
3.2</p>
        <p>Estimation of parameters
The common estimation methods for IRT are joint maximum likelihood
estimation, marginal maximum likelihood estimation, and Bayesian estimation.
However, it is difficult to calculate the joint maximum likelihood if the number of
students increases. Marginal maximum likelihood estimation overcomes this
issue by reducing the number of students through marginalization. On the other
hand, it does not work when results are all correct or all incorrect. In this paper,
we use Bayesian estimation in order to estimate parameters because it solves
above the problems.</p>
        <p>Although Bayesian estimation can analytically solve for a simple model like
the Rasch model through Equation (9), it cannot solve the following complex
model. In this paper, we use the Markov Chain Monte Carlo method, which can
estimate the parameters of a complex model.
4
4.1</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Related Work</title>
      <sec id="sec-4-1">
        <title>Rasch model with forgetting</title>
        <p>Lindsey et al. have developed the Rasch model using a theory of forgetting [5]
through Equation (10), which is based on Equation (9), as follows:
Pij (y = true) =
where tij indicates the elapsed time between the initial presentation of item j to
student i and a later recall test, ~i indicates a forgetting parameter for student
i, ~j indicates a forgetting parameter for item j, and h is a scaling parameter.</p>
        <p>The Rasch model with forgetting takes into account the elapsed time and
the forgetting parameter. It is believed that human memory decays over time.
The proposed model Equation (10) incorporates elapsed time, because of which
the probability of a correct response decreases with time.
Khajah et al. have developed a method that combines knowledge tracing and
the Rasch model in Equation (9), and yielded a higher prediction accuracy than
previous methods [6].</p>
        <p>We describe the method of combining two models. Equation (8) for knowledge
tracing is rearranged as Equation (11) as follows:</p>
        <p>P (ytjy(t 1)) =</p>
        <p>∑ P (ytjkt = l) P (kt = ljy(t 1));
l2fmastered;
not masterdg
where y(t 1) = y0:::yt 1. P (ytjkt = l) which, appears on the right-hand side
of Equation (11), and represents slip and guess. This part is replaced with the
Rasch model as follows:</p>
        <p>P (ytjy(t 1)) =</p>
        <p>∑ Rasch( it ; jt ; cl) P (kt = ljy(t 1)):
l2fmastered;
not masterdg</p>
        <p>The Rasch model, as Equation (12), is added as a parameter of cl. Although
the IRT does not have the two parameters of slip and guess, cl is added to the
model. The model adds parameter cl to Equation (9) of the Rasch model to
Equation (13) as follows:</p>
        <p>Rasch( ) = cl +</p>
        <p>1 cl
1 + exp( 1:7( i
j ))
:
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Proposed Method</title>
      <p>In this paper, we propose a method that combines knowledge tracing and the
Rasch model with forgetting in order to improve prediction accuracy. In the
proposed model, we replace the Rasch function in equation (12) with the Rasch
model with forgetting in equation (10). We similarly adds parameter cl to
Equation (10). The combined model can be represented as follows:</p>
      <p>P (ytjy(t 1)) =</p>
      <p>∑ RF( it ; jt ; cl) P (kt = ljy(t 1));
l2fmastered;
not masterdg
(11)
(12)
(13)
(14)
RF( ) = cl +
1 + exp( 1:7( i j ))</p>
      <p>We employed Bayesian estimation to estimate the parameters of the model as
in Section 3.2. We did not use simple a Bayesian model, but applied a Bayesian
hierarchical model because it has hyperprior distributions.</p>
    </sec>
    <sec id="sec-6">
      <title>Experiments</title>
      <p>Overview of experiments
We conducted two experiments to evaluate the proposed model. A dataset was
divided into training and test data. The training data was used to t the
parameters of the model and the test data to assess its generalization error. We veri ed
that the proposed method could predict whether a given answer by a student
was correct. We compared our method with two others: (i) original knowledge
tracing, and (ii) the method represented in Equation (12). The proposed method
is as in Equations (14) and (15).</p>
      <p>We employed AUC (Area Under the Curve) and RMSE (Root Mean-squared
Error) as measures for evaluation. AUC is a metric for a two-class prediction
problem; the value of the AUC is 1 if the prediction is completely correct and 0.5
if the prediction is random. RMSE is a metric for numerical predictions, where
its value represents the difference between the values predicted by a model and
those observed. In short, a high-performance model indicates a value close to 1
on the AUC and close to 0 in terms of the RMSE.
6.2</p>
      <p>
        Dataset
In this experiment, we applied three methods to two datasets of synthetic data
and the Bridge to Algebra 2006-2007 [7]. Table 1 presents an overview of each
dataset.
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) Synthetic data We employed IRT to generate the synthetic data. We
assumed that if an item was assigned to a student once, the student's skill
to solve the item increased. In order to add a decay effect, we calculated the
retention interval between the initial presentation of an item to a student and a
later recall assignment. If the elapsed time was long, the student's skill to solve
the item decreased.
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) Bridge to Algebra 2006-2007 This dataset was used at the KDD Cup
2010 Educational Data mining Challenge as actual data from an e-Learning
system. We omitted items that have less than 200 records and items requiring a
de ned skill to be solved.
      </p>
      <p>
        0.81
0.8
0.79
0.78
0.77
0.76
0.75
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) Synthetic data Figure 2 shows the prediction results for each method for
synthetic data. The graphs show (i) original method (knowledge tracing), (ii)
previous method (knowledge tracing and IRT), and (iii) the proposed method
(knowledge tracing and IRT with forgetting) from the left in Figure 2. The
values of the AUC of the previous method and the proposed method were greater
than that for original knowledge tracing in Figure 2(a). There was no signi cant
difference between the previous method and the proposed method. However, the
value of RMSE in Figure 2(b) shows that the proposed method has superior
prediction ability than the previous methods. Therefor, the results indicated
that the proposed method was the most effective.
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) Bridge to Algebra 2006-2007 Figure 3(a) shows the prediction results
for each method on actual data. Our proposed methods yielded the best
performance, whereas there was slight difference between the results for the proposed
method and the previous method. However, the value of RMSE of the proposed
method indicated lower than previous method in Figure 3(b).
7
      </p>
    </sec>
    <sec id="sec-7">
      <title>Conclusion</title>
      <p>In this paper, we proposed a novel combination of knowledge tracing and IRT
with a decay effect in order to improve the previous method. The proposed
approach showed promising effectiveness on real-world datasets.</p>
      <p>Original Previous Proposed</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgment</title>
      <p>This work was supported by JSPS KAKENHI Grant Number JP16K01095.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>T.</given-names>
            <surname>Calders</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pechenizkiy</surname>
          </string-name>
          ,
          <article-title>Introduction to The Special Section on Educational Data Mining</article-title>
          ,
          <string-name>
            <surname>SIGKDD</surname>
          </string-name>
          , Vol.
          <volume>13</volume>
          ,
          <string-name>
            <surname>Issue</surname>
          </string-name>
          . 2, pp.
          <volume>3</volume>
          {
          <issue>5</issue>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A. T.</given-names>
            <surname>Corbett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <article-title>Knowledge Tracing: Modeling the Acquisition of Procedural Knowledge, User Modeling</article-title>
          and
          <string-name>
            <surname>User-Adapted Interaction</surname>
          </string-name>
          ,
          <volume>4</volume>
          (
          <issue>4</issue>
          ), pp.
          <volume>253</volume>
          {
          <issue>278</issue>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>S.E.</given-names>
            <surname>Levinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.R.</given-names>
            <surname>Rabiner</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.M. Sondhi</surname>
          </string-name>
          ,
          <article-title>An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition</article-title>
          ,
          <source>Bell System Technical Journal</source>
          , Vol.
          <volume>62</volume>
          ,
          <string-name>
            <surname>Issue</surname>
          </string-name>
          . 4, pp.
          <volume>1035</volume>
          {
          <issue>1074</issue>
          ,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Wim</surname>
            <given-names>J. van der Linden</given-names>
          </string-name>
          , Ronald K. Hambleton,
          <source>Handbook of Modern Item Response Theory</source>
          , Springer,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>R.V.</given-names>
            <surname>Lindsey</surname>
          </string-name>
          , M.C. Mozer, Predicting Individual Differences in Student Learning via Collaborative Filtering, Submitted,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Khajah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Gonzalez-Brenes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Mozer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Brusilovsk</surname>
          </string-name>
          ,
          <article-title>Integrating Knowledge Tracing and Item Response Theory: A Tale of Two Frameworks</article-title>
          ,
          <source>Proceedings of Workshop on Personalization Approaches in Learning Environments (PALE2014) at the 22th International Conference on User Modeling, Adaptation, and Personalization</source>
          , pp.
          <volume>7</volume>
          {
          <issue>12</issue>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>J.</given-names>
            <surname>Stamper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Niculescu-Mizil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ritter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Gordon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Koedinger</surname>
          </string-name>
          , Bridge to Algebra 2006-2007,
          <article-title>Development data set from KDD Cup 2010 Educational Data Mining Challenge, (http://pslcdatashop</article-title>
          .web.cmu.edu/KDDCup/downloads.jsp).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>