<!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>Modelling the COVID-19 Virus Evolution With Incremental Machine Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dublin</string-name>
          <email>luis.miralles@tudublin.ie</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ireland</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>andres.suarez-cetrulo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ankit.kumar}@ucd.ie</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Technological University Dublin</institution>
          ,
          <addr-line>Grangegorman, Dublin</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <issue>2</issue>
      <abstract>
        <p>The investment of time and resources for better strategies and methodologies to tackle a potential pandemic is key for dealing with potential outbreaks of new variants or other viruses in the future. In this work, we recreated the scene of 2020 for the fifty countries with more COVID-19 cases reported. We performed some experiments to compare state-of-the-art machine learning algorithms, such as LSTM, against online incremental learning methods (ILMs) in terms of how well they adapted to the daily changes in the spread of the disease and predict future COVID-19 cases. To compare the methods, we performed two experiments: In the first experiment, we trained the models using only data from the country we predicted. In the second one, we used data from the fifty countries to train and predict each one of them. In these two experiments, we used a static hold-out approach for all the methods. Results show that ILMs are a promising approach to model the disease changes over time; ILMs are always up-to-date with the latest state of the data distribution, and they have a significantly lower computational cost than other techniques such as LSTMs.</p>
      </abstract>
      <kwd-group>
        <kwd>Incremental Machine Learning</kwd>
        <kwd>Modelling COVID-19</kwd>
        <kwd>COVID19 cases prediction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Pandemic curves are non-stationary by nature. Depending on the period, they
can show diferent characteristics such as clear trends, cycles, or seasons where
a random component is more prevalent. Moreover, the COVID-19 spread in
each region is afected by external factors not captured in the available data
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Under these circumstances, incremental and online machine learning (ML)
techniques [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] that adapt to the evolution of the trend and its changes, are
gaining traction in diferent domains [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>The purpose of this work is to explore the suitability of online ILMs to
accurately predict the evolution of the COVID-19 virus spread. It is crucial to
do more research to find the best strategies and methodologies to tackle potential
Copyright 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)
outbreaks of other potential viruses so that their efects on public health can be
addressed in a better way in the future. Online ILMs have not been exploited
yet to this end. Online ILMs represent a relevant alternative due to their ability
to adapt to non-stationary behaviours, which is very characteristic of epidemic
curves.</p>
      <p>
        These methods and the notion of concept drift have not gained enough
attention yet in the coronavirus prediction domain. Concept drift means that the
relationships between the inputs and the outputs can change over time due to
diferent circumstances. However, ILMs can deal actively or passively [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] with
the non-stationary nature of data streams such as the COVID-19 curve
evolution [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. ILMs do this by adapting (passive) to the non-stationary nature of the
data or through the use of drift detectors (active). These methods can find an
equilibrium between prioritising new knowledge, adapting to changes, and
retaining relevant information through diferent forgetting mechanisms. This balance
is known as the stability-plasticity dilemma [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>This work aims to forecast the number of positive COVID-19 cases in multiple
countries using ILMs and compare their performance with static ML methods.</p>
      <p>Our contribution consists of proposing a framework to predict the number of
new cases while dealing with the evolution in the spread of the curve in diferent
countries. We created a framework (see Github link 3) to encourage the scientific
community to use it as a benchmark to develop new models and strategies to
predict COVID-19 cases. To our knowledge, no other publications show the
benefits of applying ILMs to predict the number of cases in a pandemic, which
makes our research a significant contribution to this area.</p>
      <p>The rest of the paper is organised as follows: Section 2 presents an overview
of the ILMs. Section 3 presents the conducted experiments to compare the
performance of the ILMs methods against other popular methods such as LSTM
networks. Then, the performance of all methods is compared under diferent
scenarios and training schemes to find out the optimal configuration. Section 4
compares the obtained results for each of the models and presents an analysis
for both the static and the ILMs. Finally, section 5 presents the main findings of
our investigation and recommends some interesting lines of research for future
work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>State of the art</title>
      <p>
        We selected a set of four incremental regression ML models to compare them with
the following ML methods: Bayesian Ridge Regression, Linear Support Vector
Regression, Random Forest, Decision Tree, Gradient Boosting, and LSTM. Our
choice of ILMs covers Incremental Decision Trees that are frequently used for
regression problems in the literature [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and also Adaptive Random Forest for
Regression [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], which are an ensemble of incremental trees that have
state-ofthe-art results in online incremental learning. A description of them can be seen
below.
3 http://www.github.com/ankitk2109/Covid_Evolution_Using_Incremental_ML.
– A Hoefding tree (HT) is an ILMs that assumes that the data distribution is
constant over time. This relies mathematically on Hoefding bounds, which
supports that a small sample may sufice to choose an optimal splitting
attribute. Hoefding Trees for regression calculate the decrease of the variance
of the target to decide the splits. Its leaf nodes fit linear perceptron models
by default [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
– The Hoefding Adaptive Tree (HAT) is an adaptive version of the Hoefding
Tree. It replaces old branches with new ones if the error of the old ones
increases over time and new branches perform better. To monitor the
evolution of the errors, it uses the Adaptive Windowing (ADWIN) algorithm [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
HAT also proposes a bootstrap sampling as an improvement over Hoefding
Trees.
– Adaptive Random Forest (ARF) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] is an Adaptive version of the Random
Forest ensemble for Data Streams. It manages a pool of trees that are
replaced with new ones when a concept drift is detected. As an improvement
of RF, each adaptive tree is trained with diferent samples and feature sets
as part of the bagging and the feature bagging process.
– The Passive-Aggressive algorithm (PA) is an online learning algorithm that
updates the model depending on the obtained error [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Experiments and results</title>
      <p>In this section, we conduct some experiments in which we compare the
performance of ILMs with that of static ML methods; among them, we emphasise
the popular deep learning method called LSTM. Our goal is to see if ILMs can
quickly adapt to the COVID-19 spread for predicting the number of cases in
each country.
3.1</p>
      <sec id="sec-3-1">
        <title>Dataset description</title>
        <p>For this work, we used the dataset “COVID-19 Coronavirus data - daily (up to
December 14th 2020)” available in the European Open Data Portal4 and
provided by the European Centre for Disease Prevention and Control. The original
dataset contains twelve columns with daily information about the disease in 213
countries during 2020; it is structured as follows. One column represents the
number of positive cases, another column the number of deaths. Four columns
are related to the current date, four other columns are related to country-specific
information, one column refers to the continent. And lastly, there is one column
that represents the cumulative number of the COVID-19 cases for 14 days per
100,000 inhabitants.</p>
        <p>Regarding the preprocessing steps performed before creating the nfial dataset
for the experiments, the columns related to dates and countries were used to split
4
https://data.europa.eu/euodp/en/data/dataset/covid-19-coronavirus-data-dailyup-to-14-december-2020
the training and testing datasets. The number of new cases is the only column
used to generate the feature set (input of the model) and the target (output of
the model). The rest of the columns were removed. From the countries with eight
or more months of data by November 30th, 2020 (66 in total), to conduct the
experiments, we selected the 50 with the highest number of accumulated cases
of COVID-19.</p>
        <p>Each data example corresponds to a moving time window of fifty consecutive
days representing the inputs of the regression model. The target/output of the
model is the average of ten consecutive days, where the first of those ten days is 30
days ahead of the last day of the input. The main reason for using the average of
ten days is to soften some spikes due to potential delays when reporting the test
results. We also wanted to predict 30 days ahead because it allows governments
to plan the next few weeks to lift or apply new restrictions on the population.
The number of rows for each trained model varies according to the experiment
as explained in more detail in section 3.3. The feature set (inputs of the model)
was created according to the scheme shown in Figure 1.
Our primary concern in these experiments is to put ourselves in the shoes of a
country facing a pandemic that only has certain information available at a
particular date, and that needs to generate models to predict the future COVID-19
cases so that it can provide the government with useful information for
taking the optimal actions. Those actions could be closing schools, limiting public
transport, applying lock-downs, among others.</p>
        <p>The experiments were conducted to answer the following two questions. First,
between incremental and static methods, which have higher performance for
predicting the number of new COVID-19 cases? And, second, what is the best
option between these two for training a model to predict the future number
of cases of COVID-19 for a given country? a) Training the model only with
the samples of that same country which the model was going to predict. Or b)
Training the model with the complete dataset of fifty countries.</p>
        <p>To respond to these questions, initially, we performed two experiments. In
experiment I, we trained the static and incremental methods with only one
country, and we predicted the future COVID-19 cases for that same country. In
the second experiment, we predicted over one country, but this time, we trained
the supervised models with the 50 countries with most cases. Then, we compared
the performance of training the models using a single country with the results
obtained using multiple countries (MC). To make ILMs comparable, we trained
and tested all the algorithms using the same training and testing sets. However,
ILMs for data streams are designed to be trained continuously, and static train
and test splits are not generally applied to ILMs in the literature.</p>
        <p>This continuous training setting is not usually applied in static ML models
due to the computational burden of training an algorithm for each new training
batch. Static models need re-training strategies to keep the models up to date
when dealing with non-stationary or continuous learning scenarios. In any case,
the use or optimisation of re-training strategies is outside the scope of this paper.
Still, to make a fair comparison, we used the training sets (input models) shown
in Figure 2 as a pre-trainining set and used the test splits (output models) shown
in the same figure as a test-then-train set.</p>
        <p>To calculate the average performance of the diferent algorithms during the
pandemic, these methods were evaluated at eight points in time, which we called
milestones. Each milestone represents a date on which we predicted future cases
considering only previous information to that point. Figure 2 illustrates the
evaluation of the applied ML methods. Each milestone’s test set covers a month
interval after its respective training set. Using the subset of dates given by each
monthly milestone, we created samples that contain train and test data for the
subsequent experiments.</p>
        <p>Day 1
30
60
90
120
...</p>
        <p>Day
300
Input Model I Output Model I</p>
        <p>Input Model II</p>
        <p>Output Model II
Input Model III</p>
        <p>Output Model III</p>
        <p>
          Since the number of models was four hundred, eight milestones per fifty
models, all algorithms are implemented using their default vanilla configuration.
A validation set for back-propagation was created using the last ten days of the
training set at each respective milestone for the LSTM only. In this paper, we
use the version of Passive-Aggressive Regressor provided in Scikit-Learn [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
For the rest of the approaches, we have used the implementation provided in
Scikit-Multiflow.
        </p>
        <p>The LSTM was trained for 500 epochs in both experiments. However, the
batch size and patience were diferent in the SC and MC approaches. The batch
size refers to the number of training examples used in one iteration when training
the LSTM sequentially. Patience represents the number of epochs to wait before
early stop training the algorithm if the model does not lower its error.</p>
        <p>
          In experiment I, we defined a batch size of 10 examples (one example per
day) and a patience of 20 examples for the LSTM. In experiment II, we defined
a batch size of 500 examples (10 days multiplied by 50 countries) and a patience
of 1000 examples (20 days multiplied by 50 countries). This methodology of
dividing the dataset into milestones and calculating the error as the average of
the milestones was used throughout all the experiments. The performance of
the models was measured using the Mean Absolute Percentage Error (MAPE)
according to the state-of-the-art metrics for regression [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. The results are
calculated by comparing the model’s predictions to the target feature in the test set
(or test-then-train set in ILM).
        </p>
        <p>MAPE describes how far the predictions of a model are from their
corresponding outputs on average. MAPE allows comparing forecasts of diferent series in
diferent scales as it is expressed in percentage-like terms. Results from MAPE
can also difer from MAE as MAPE’s values are undefined for data examples
where the target or prediction value is zero. Thus, MAPE would be higher for
an algorithm compared to other metrics if the target values are close to zero.
This paper considers MAPE as the evaluation metric mainly because it is a unit
free metric and reports percentage-like terms.</p>
        <p>Section 3.3 shows and discusses the results of three experiments performed
in this work. Experiment I is focused on models trained for a single-country
(SC). Each algorithm is trained and tested at eight diferent points in time, as
explained in Figure 2. Experiment II applies the same process and periods as
Experiment I, but each algorithm is trained with all the dataset covering all
countries. Rows in these datasets are sorted first by date and then by country
to respect the chronicle order of the time series for the diferent training, test
splits and batches already mentioned.</p>
        <p>To compare the SC results with the multi-country (MC) results from
Experiment 2, the errors from the 50 models trained for an SC are averaged. Another
diference between Experiment I and Experiment II relies on the batch size for
the incremental and sequential learners. Batches are time-wise for a set of days.
Thus, a batch of data during training or testing is 50 times bigger in Experiment
II because we are training the models with data from 50 countries rather than
with a single one. Finally, we compare the results from the SC with the MC
approach.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Experimentation</title>
        <p>In this section, we show the results in diferent plots for the two diferent
experiments. We also add a subsection in which we compare the performance of the
single country approach with the MC approach.</p>
        <p>Experiment I: Single-Country training This experiment trains the
supervised ML models with an SC and predicts the cases for the same SC with which
the model is trained. Results are obtained averaging eight points called
milestones for which predictions are made. Albeit the top performers can change in
diferent countries, it is clear that the static methods show an overall
performance higher than the ILMs</p>
        <p>Although Gradient Boosting and the Decision Tree are the algorithms with
the lowest MAPE, we also consider that LSTM is one the best performers for
SC experiments in the context of the COVID-19 crisis since it obtains the lowest
average MAPE across all milestones.</p>
        <p>1000
100
10
PE 1
A
M 0.1</p>
        <p>Experiment II: Multiple-Countries training This second experiment
predicts over the same 50 countries at the same eight points as Experiment I, but
this time we train the model with 50 countries rather than training it with a
single country as in Experiment I. In the MC experiment, Support Vector and
the tree-based ILMs (HT, HAT and ARF) obtain the lowest MAPE across the
eight-time points. Figure 4 shows how HT and HAT have a lower median MAPE
than Support Vector Regression. According to Figure 4, HT and HAT seem the
most reliable predictor for the MC experiment, as they ofer the lowest medians,
and most of their experiments fall into a normal distribution. Using the median
MAPE rather than its mean as a comparative metric is helpful since the value
of the mean can be distorted by the outliers.</p>
        <p>Incremental
Sequential
Static</p>
        <p>Regarding the time for training the methods, Support Vector Regression
proves to be the most cost-efective solution across the eight milestones. Support
Vector Regression obtains one of the three lowest MAPE and is the fourth fastest
method of all the algorithms benchmarked in experiment II. Figures 4 and 3 are
both ordered by the median of the MAPE values in eight-time points. While
LSTM, Decision trees, Gradient Boosting and Random Forest ofer overall better
results in SC, the ILMs have better performance in terms of MAPE in the
MC approach. We believe that the dominance of the ILMs in the results of
the MC approach is because these can handle complex scenarios better, due
to their sequential training nature. We give more details on these thoughts in
subsection 3.3.</p>
        <p>The evolution of the MAPE obtained by each model per time-point can
be seen in Figure 5. It can be seen how the ILMs HT and HAT are the best
performers in the last milestone, followed by LSTM, which shows a smooth
evolution across the milestones. The next best performer in the last milestone is
Linear SVR, which shows the lowest MAPE mean due to its good performance
for less training data in the initial milestones.</p>
        <p>Comparison between the single country training and Multiple-countries
training In the second experiment, all countries were concatenated under a
single dataset. The MC approach was proposed to provide both static and ILMs
with an augmented dataset that includes other countries’ information and test
their predictive ability with a more complex but broader set. The reader must
note that this experiment was conducted to test the capacity of the models to
handle a set of multiple countries where the curve of cases may not be aligned
in all cases between diferent countries. We are aware that a batch for the ILMs
may feed multiple states of the COVID-19 curve due to the diferent countries
used. However, we consider this could be handled, for instance, by incremental
ensembles like ARF.</p>
        <p>1000
l)ae 100
c
s
g
o
L
(
E
PAM 10
1
Linear SVR
HT
HAT
ARF
LSTM
BayesianRidge
PA
Random Forest
Gradient Boosting
Decision Tree</p>
        <p>Milestone 1 Milestone 2 Milestone 3 Milestone 4 Milestone 5 Milestone 6 Milestone 7 Milestone 8</p>
        <p>In general, the SC approach exhibits lower MAPE values than the MC
approach. Thus, SC can be seen as the best of the two approaches. The LSTM (SC)
is the best performer overall across the 50 countries used in the experiments in
the eight-time points. We believe that the MC experiment needs a model able to
map non-linearity sequentially or incrementally. We believe this could be
handled by an incremental ensemble like Adaptive Random Forest (ARF). However,
ARF was designed for purely incremental scenarios, and the purpose of its drifts
detectors is to replace base regressors when the data distribution requires. Thus,
the hold-out, static evaluation scheme used in this paper constrains this designed
behaviour.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Discussion</title>
      <p>Experiments I and II compare traditional machine learning regression algorithms
to ILMs for 50 countries, eight-time points and a common hold-out evaluation
scheme. Their results show how traditional static ML techniques perform better
than ILMs in the SC experiment. Models like HT and ARF are designed for data
streaming scenarios and to handle large amounts of data. We see how they beat
static methods when trained for a broader set in the MC approach. These tend
to adapt better over time and ofer the best performance in the last milestones.
Furthermore, ILMs are oriented to online scenarios and continuous adaptation.</p>
      <p>While one may think that the MC approach should give enough information
to most models to improve their performance, the results show the opposite.
This is probably because many of these countries have very diferent behaviours
in the evolution of COVID-19 cases and can mislead rather than help when
the model predict a particular country. That is to say, at the same time point,
diferent countries may be in states of an outbreak diferent from each other,
such as at the start or the end of a diferent COVID-19 wave. The presence of
diferent states of the disease across countries adds extra complexity to the MC
approach compared to the SC approach. COVID-19 is an example of a concept
drifting environment. This experiment evaluates the ability of the ILMs to deal
with diferent drift concepts at a time, as diferent countries could be on diferent
moments of waves (or even in diferent waves).</p>
      <p>In the MC experiment, Support Vector regression presents lower MAPE for
the first milestones. However, incremental approaches improve their performance
as the training data increases. In any case, there is no statistical significance
between SVR and LSTM in the MC experiment. The LSTM is overall the
best method across experiments. Besides its computational cost (20 times the
runnning time of ILM), it ofers a smooth adaptation as the data set increases
(see Figure 5).</p>
      <p>Our results show how ILMs can obtain the lowest error for the MC
experiment. ARF, the ensemble of HT, is the incremental algorithm with the lowest
MAPE when using a prequential evaluation. We believe that diferent trees of
the adaptive ensemble may be learning about diferent sets of countries (due to
the bagging mechanism) that may perform more or less similar and adapt
continuously to any concept changes. As for adaptive single learners or static
ensembles, other algorithms can adapt to diferent concepts by learning incrementally
or having a set of base learners for diferent stationarities using a prequential
scheme.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>In this paper, we backtested the daily information about COVID-19 cases during
2020 for 50 diferent countries to recreate a situation in which the countries had
to face the threat of the number of cases increasing and protect the economy of
the country at the same time. In 2020, the information about the spread of the
virus and the new outbreaks was very limited. Our research is valuable because
of the insights of the experiments in which we compare ML static methods versus
the performance of online ILMs for predicting the number of new cases.</p>
      <p>Our results show that the proposed approach of using ILMs can outperform
the traditional literature static methods when training for multiple countries.
ILMs adapt over time and obtain lower errors in the last periods. These
algorithms also show their ability to adapt to the non-stationarities exhibited in
these time series. ARF obtains a MAPE error four times lower when using a
prequential evaluation instead of a hold-out scheme. Across experiments I and II,
the SC experiment obtains the best results. In the SC experiment, the LSTM is
the algorithm with the lowest MAPE. We should highlight that since the LSTM
is designed to handle data of a sequential nature and previous results from the
literature, its performance is not a surprise. The LSTM is one of the algorithms
that adapt better over time across the milestones in the MC experiment. In any
case, even following a hold-out scheme, the ILMs HT and HAT obtain the lowest
median MAPE.</p>
      <p>Lastly, we proved that models trained with an SC tend to obtain lower errors
(better results) and that the error tends to diminish as the models are trained
with more information. This is probably because some countries are very diferent
from each other and can misguide the classifier. For the approach of predicting
single countries, ILMs tend to obtain higher errors (worse results) than those in
other ML techniques when compared using the static scheme of train and test
hold-out splits. In any case, the proposed hold-out static scheme has proved to
be a constraint by design for ILMs.</p>
      <p>For future work, we would like to explore a new approach. Rather than
training a classifier with all the 50 countries, we could train the classifier only
with those that behave similarly to the one being predicted. In other words,
we will calculate first the distance between the two countries using a time
series similarity measure such as euclidean distance, Dynamic Time Warping, or
Symbolic Aggregate approXimation (SAX). And then we will use a threshold to
select the countries with the lower distance to the predicted country. We would
also like to compare our model to other approaches like the SEIR
(susceptibleexposed-infected-recovered) or the SIR model that have been widely used for
this purpose.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bahri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bifet</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gama</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomes</surname>
            ,
            <given-names>H.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maniu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Data stream analysis: Foundations, major tasks and tools</article-title>
          .
          <source>WIREs Data Mining and Knowledge Discovery</source>
          <volume>11</volume>
          (
          <issue>3</issue>
          ),
          <year>e1405</year>
          (
          <year>2021</year>
          ). https://doi.org/10.1002/widm.1405
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bifet</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gavalda</surname>
            <given-names>`</given-names>
          </string-name>
          , R.:
          <article-title>Adaptive learning from evolving data streams</article-title>
          .
          <source>In: International Symposium on Intelligent Data Analysis</source>
          . pp.
          <fpage>249</fpage>
          -
          <lpage>260</lpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Botchkarev</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Performance metrics (error measures) in machine learning regression, forecasting and prognostics: Properties and typology</article-title>
          . arXiv preprint arXiv:
          <year>1809</year>
          .
          <volume>03006</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Crammer</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dekel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keshet</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shalev-Shwartz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singer</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Online passiveaggressive algorithms</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>7</volume>
          (
          <issue>19</issue>
          ),
          <fpage>551</fpage>
          -
          <lpage>585</lpage>
          (
          <year>2006</year>
          ), http://jmlr.org/papers/v7/crammer06a.html
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ditzler</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roveri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alippi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polikar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Learning in Nonstationary Environments: A Survey (nov</article-title>
          <year>2015</year>
          ). https://doi.org/10.1109/
          <string-name>
            <surname>MCI</surname>
          </string-name>
          .
          <year>2015</year>
          .2471196
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Domingos</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hulten</surname>
          </string-name>
          , G.:
          <article-title>Mining high-speed data streams</article-title>
          .
          <source>In: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          . pp.
          <fpage>71</fpage>
          -
          <lpage>80</lpage>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Elwell</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polikar</surname>
          </string-name>
          , R.:
          <article-title>Incremental learning of concept drift in nonstationary environments</article-title>
          .
          <source>IEEE transactions on neural networks 22(10)</source>
          ,
          <fpage>1517</fpage>
          -
          <lpage>31</lpage>
          (10
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Gama</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          , Zˇliobaite˙,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Bifet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Pechenizkiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Bouchachia</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>A Survey on Concept Drift Adaptation</article-title>
          .
          <source>ACM Comput. Surv</source>
          <volume>1</volume>
          (
          <issue>35</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>37</lpage>
          (mar
          <year>2013</year>
          ). https://doi.org/10.1145/0000000.0000000
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Gomes</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bifet</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boiko</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barddal</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Enembreck</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pfharinger</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holmes</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abdessalem</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Adaptive random forests for evolving data stream regression</article-title>
          .
          <source>Machine Learning</source>
          <volume>106</volume>
          (
          <fpage>9</fpage>
          -
          <lpage>10</lpage>
          ) (
          <year>2017</year>
          ). https://doi.org/10.1007/s10994-017-5642-8
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Pedregosa</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varoquaux</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gramfort</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Michel</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thirion</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grisel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blondel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prettenhofer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dubourg</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , et al.:
          <article-title>Scikit-learn: Machine learning in python</article-title>
          .
          <source>the Journal of machine Learning research 12</source>
          ,
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koh</surname>
            ,
            <given-names>Y.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , E.:
          <article-title>Detecting protected health information with an incremental learning ensemble: A case study on new zealand clinical text</article-title>
          .
          <source>In: 2020 IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA)</source>
          . pp.
          <fpage>719</fpage>
          -
          <lpage>728</lpage>
          (
          <year>2020</year>
          ). https://doi.org/10.1109/DSAA49011.
          <year>2020</year>
          .00082
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Tsymbal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The Problem of Concept Drift: Definitions and Related Work</article-title>
          .
          <source>Technical Report: TCD-CS-2004-15</source>
          , Department of Computer Science Trinity College, Dublin (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Didelot</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wong</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shi</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>G.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bi</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Inference of person-to-person transmission of covid-19 reveals hidden super-spreading events during the early outbreak phase</article-title>
          .
          <source>Nature communications 11(1)</source>
          ,
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>