<!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>Gaussian Processes for Anomaly Description in Production Environments</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Christian Beecks</string-name>
          <email>christian.beecks@uni-muenster.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabian Berns</string-name>
          <email>fabian.berns@uni-muenster.de</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kjeld Willy Schmidt</string-name>
          <email>kjeld.schmidt@uni-muenster.de</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexander Grass</string-name>
          <email>alexander.grass@fit.fraunhofer.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Fraunhofer Institute for Applied Information</institution>
          ,
          <addr-line>Technology FIT</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Münster and Fraunhofer Institute for, Applied Information Technology FIT</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Münster</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University of Münster</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Concomitant with the rapid spread of cyber-physical systems and the advancement of technologies from the Internet of Things, many modern production environments are characterized by vast amounts of sensor data which are generated throughout diferent stages of production processes. In this paper, we propose a novel method for discovering the inherent structures of anomalies arising in IoT sensor data. Our idea consists in modeling and describing anomalies by means of kernel expressions, which are combinations of well-known kernels. The results of our empirical analysis show that our proposal is suitable for modeling diferently structured anomalies. Moreover, the results indicate that Gaussian processes provide a powerful tool for future algorithmic investigations of IoT sensor data.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>Concomitant with the rapid spread of cyber-physical systems
and the advancement of technologies from the Internet of Things
(IoT), many modern production environments are characterized
by vast amounts of sensor data which are generated
throughout diferent stages of production processes. These sensor data
streams are often considered as valuable information sources
with a high economic potential and are characterized by high
volume, velocity and variety. Their data-driven value is indisputable
for optimizing and fine-tuning industrial production processes.</p>
      <p>
        Monitoring sensor data from complex production processes in
order to detect outliers or low-performing production behavior
caused by undesired drifts and trends, which we summarize as
anomalies, is a challenging task. Not only due to the massive
amount of sensor data but also due to diferent types of
anomalies, which are potentially unknown in advance, manual or
automatic inspection systems are frequently supported by anomaly
detection algorithms. While the last years have witnessed the
development of diferent anomaly detection algorithms, cf. the
work of Renaudie et al. [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] for a recent performance evaluation
in an industrial context, only less efort has been spent to the
investigation of the inherent structure of an anomaly.
      </p>
      <p>In this paper, we thus propose a novel method to discover the
inherent structure of an anomaly. Our idea consists in
modeling and describing anomalies by means of kernel expressions,
First International Workshop on Data Science for Industry 4.0.</p>
      <p>Copyright ©2019 for the individual papers by the papers’ authors. Copying
permitted for private and academic purposes. This volume is published and copyrighted
by its editors.</p>
    </sec>
    <sec id="sec-2">
      <title>RELATED WORK</title>
      <p>
        Strongly related to our approach are anomaly detection
algorithms. There is a plethora of these algorithms including Z-Score
[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], Mahalanobis Distance-Based, Empirical Covariance
Estimation [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], Mahalanobis Distance-Based, Robust Covariance
Estimation [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], Subspace-based PCA Anomaly Detector [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ],
One-Class SVM [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], Isolation Forest (I-Forest) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], Gaussian Mixture Model [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], Deep Auto-Encoder
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], Local Outlier Factor [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], Least Squares Anomaly
Detector [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], GADPL [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and k-nearest Neighbour [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>
        While these algorithms are all possible options for anomaly
detection, as shown in diferent surveys such as [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] and [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ],
they are not directly suited for describing the inherent structure
of anomalies, which is the major focus of this paper. We choose
the means of Gaussian processes for anomaly description due
to their capability to not only gather statistical indicators, but
deliver the very characteristics of specific anomalous behavior
from the data [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>
        For describing these characteristics, Lloyd et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] have
proposed the Automatic Bayesian Covariance Discovery System
that adapts the Compositional Kernel Search Algorithm [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] by
adding intuitive natural language descriptions of the function
classes described by their models. In [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], these models are
expanded to discover kernel structures which are able to explain
multiple time series at once.
      </p>
      <p>In this work, we make use of these algorithms in order to
describe the inherent structures of anomalies, as shown in the
following section.
3</p>
    </sec>
    <sec id="sec-3">
      <title>GAUSSIAN PROCESSES</title>
      <p>In this section, we describe the analysis of anomalies in sensor
data via Gaussian processes. To this end, we assume the sensor
data to be univariate2 and an anomaly A to be a finite subsequence
of timestamp-value pairs A = {(ti , vi )}in=i with timestamps ti ∈ T
and values vi ∈ R.</p>
      <p>As we do not know in advance the number of values and the
distances between individual timestamps, we can also thought
of an anomaly A as a mathematical function A : T → R, which
assigns every timestamp t ∈ T a real-valued value v(t ) ∈ R. By
considering the individual values v(t ) to be random variables
following a Gaussian distribution, we can formalize the Gaussian
process as</p>
      <p>v(t ) ∼ GP (m(t ), k(t, t ′)),
where m(t ) = E[v(t )] is the mean function and k(t, t ′) =
E[(v(t ) −m(t )) · (v(t ′) −m(t ′))] is the covariance function k : T ×
T → R. In other words, a Gaussian process is a stochastic process
over random variables, where every subset of random variables
from the Gaussian process follows a normal distribution. The
distribution of the Gaussian process is the joint distribution of all
of these random variables and it is thus a probability distribution
over (the space of) functions in RT.</p>
      <p>While the covariance function k defined above is a general
way to model the behavior of data, we aim to describe each
anomaly A by its own covariance function kA. That is, we aim
to learn a covariance function kA, which is then also denoted as
kernel expression in the domain of machine learning, by fitting
combinations of well-known kernels, such as
• the constant kernel kC(t, t ′) = λ ∈ R,
• the linear kernel kLIN(t, t ′) = (t − l) · (t ′ − l),
• the squared exponential kernel kSE(t, t ′) = exp − |t −2lt2′ |2 ,
2 sin2 t−t′
• or the periodic kernel kPER(t, t ′) = exp l2 2 .</p>
      <p>
        In order to individually fit a kernel expression to each anomaly
based on the aforementioned kernels, we use the compositional
kernel model, as utilized for instance in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. This allows us to
decompose an anomaly into individual components, which can be
ranked by their contribution towards explaining the data. As an
      </p>
      <sec id="sec-3-1">
        <title>2It is noteworthy that this approach also applies to multivariate data.</title>
        <p>Anomaly BIC Kernel Expression
0 -799 C*PER + C*PER + C*PER
1 -706 C*SE*PER + C*SE + C
2 -604 C*PER + C*PER + C*PER + C
3 -921 C*SE*PER + C*PER + C
4 -742 C*PER + C*PER + C*SE + C
5 -543 C*SE*LIN + C*SE + C*WN + C
6 -630 C*PER + C*SE + C*WN + C
7 -1020 C*PER + C*PER + C*PER + C*SE + C
8 -762 C*SE*PER + C*PER + C
9 -1025 C*PER + C*PER + C*SE + C
10 -424 C*PER + C*SE + C*SE
11 -849 C*PER + C*PER + C*SE + C
12 -311 C*SE*PER + C*PER + C
13 -860 C*LIN + C*PER + C*PER + C*PER + C
14 -339 C*PER + C*SE + C*SE
15 -590 C*SE*PER + C*PER + C*SE
16 -503 C*PER + C*SE + C
17 -602 C*SE*PER + C*SE + C*WN + C
18 -545 C*PER + C*SE + C*SE + C
19 -804 C*PER + C*SE + C*WN + C
20 -281 C*PER + C*SE + C*SE
21 -426 C*PER + C*PER + C*SE
22 -425 C*SE*PER + C*PER + C*SE
23 -975 C*SE*PER + C*PER + C
24 -1181 C*PER*LIN + C*PER + C*SE
25 -880 C*PER*PER + C*PER + C*PER + C
26 -455 C*PER + C*PER + C*SE
27 -542 C*PER + C*SE + C*SE
Table 1: Discovered kernel structures and the Bayesian
Information Criterion (BIC) for the encountered 28
anomalies.
example, an anomaly A with a highly weighted linear kernel kLIN
indicates a hidden linearity component while a highly weighted
periodic kernel kPER indicates an inherent periodicity in the
anomaly.</p>
        <p>The resulting kernel expressions are reported and discussed
in the next section.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4 PRELIMINARY RESULTS</title>
      <p>
        In this section, we report and discuss the results of our
preliminary performance evaluation. For this purpose, we use the
recently introduced MONSOON IoT dataset [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] which comprises
357,383 data records in total. This dataset is based on a real
production line of cofee capsules and the attribute under observation
is the plastification time, that is the time which is needed to melt
(plastify) the plastic melt for the actual injection molding cycle.
More information about this process can be found in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>An overview of this attribute value, i.e. the pastification time,
as a function of the cycle number is shown in Figure 1. As can
be seen in the figure, while the normal plastification time is at
approximately 4.2 seconds, it drops down to less then 3 seconds
in case of an anomaly. Supported by domain experts, we figured
out 28 anomalies in total in this dataset, of which three are shown
in the above figure.</p>
      <p>In the first series of experiments, we computed the best
fitting kernel expressions by means of the ABCD algorithm. The
results are shown in Table 1 for each anomaly. Together with the
kernel expression of the corresponding anomaly, we also show
the Bayesian Information Criterion (BIC) value which models
the trade-of between model accuracy and size. As can be seen in
the table, all anomalies are well described by their corresponding
kernel expression (lower BIC values indicate better fit and vice
versa). Surprisingly many kernel expressions do not show a
linear component kLIN, although some anomalies clearly show this
linear tendency. We figure out that this is due to overfitting of
the kernel expression in the ABCD algorithm. We aim to address
this issue in future research.</p>
      <p>In the second series of experiments, we evaluated how suitable
a kernel expression of a certain anomaly fits to other anomalies.
The results in form of the corresponding BIC values are
summarized in Table 2. As can be seen in this table, kernel expressions
of a certain anomaly do in general not fit to other anomalies.
One reason for this behavior is the high degree of idiosyncrasy
of the anomalies. Another reason might be the overfitting issue
mentioned above.</p>
      <p>To sum up, we have investigated the potential of describing
anomalies in IoT sensor data by means of kernel expressions.
Our preliminary results indicate that our proposal is well suited
for this purpose. As one major challenge, we figure out that the
problem of overfitting needs to be addressed in future research.</p>
    </sec>
    <sec id="sec-5">
      <title>5 CONCLUSIONS AND FUTURE WORK</title>
      <p>In this paper, we have addressed the problem of discovering the
of kernel expressions, which are combinations of well-known
kernels. The results of our empirical analysis show that our
proposal is suitable for modeling diferently structured anomalies.
Moreover, the results indicate that Gaussian processes provide a
powerful tool for future algorithmic investigations of IoT sensor
data.</p>
      <p>In future work, we aim to address the problem of overfitting
by modifying the grammar used within the ABCD algorithm for
computing the kernel expressions. In addition, we aim to further
develop our proposal in order to not only describe anomalies
but also detect anomalies (which is not the focus of the current
paper). For this purpose, we aim to measure similarity in IoT
sensor data by incorporating Gaussian processes into adaptive
distance-based similarity models, such as the Signature Matching</p>
      <sec id="sec-5-1">
        <title>Distance [6], and query processing algorithms [2, 4].</title>
        <p>ACKNOWLEDGMENTS</p>
        <p>2 2 3 7 7 1 4 4 6 7 2 3 6 7 3 2 3 0 5 4 8 6 8 5 5 7
6 24 54 64 9 3 6 5 3 5 1 5 9 7 7 3 6 6 0 3 0 0 0 4 3 8 2 5 3</p>
        <p>3 4 4 4 4 4 4 8 3 5 4 5 4 1 4 4 3 3 4 4 4 0 4 4 4
2 - - - - - - - - - - 1 - 7 - 5 - 2 - - - 5 - - - 5 - -
1 5 4 6 1 4 4 0 2
6 9 2 1 1 2 8 2 1 3 8 9 0 4 7 3 6 9 5 2 5 2 3 0 9 4
4 4 4 8 1 6 1 1 1 3 2 7 4 2 0 2 1 7 1 6 5 6 6 5 1 8 2 3
5 2 8 5 7 3 8 8 8 3 8 6 1 4 8 0 8 6 8 0 0 6 4 0 8 6 8 0 0
2 2 - - - 1 - - - - - 1 1 1 - 1 4 1 - 1 1 1 5 4 - 4 - 1 1
1 8 8 0 4 1 5 3 0 1
0 0 4 0 8 9 6 3 3 9 6 6 1 9 3 7 8 4 5 8 8 2 9 3
2 0 8 2 3 0 4 7 9 0 3 2 7 6 3 1 1 0 8 0 0 7 7 9 1 4 5 9
4 5 1 2 5 3 1 9 9 3 1 6 2 0 7 4 9 2 1 3 1 5 6 4 7 1 9 3 1
2 8 - 3 - 7 - - - 1 - 1 3 1 - 8 2 1 - 6 6 1 4 6 - - - 5 8
6 7 8 4
4 2 6 2 3 6 1 4 2 4 3 2 8 5 4 7 0 3 7 0 5 6 1 7
2 2 2 5 1 6 0 8 4 1 6 8 6 9 1 7 4 0 9 4 4 9 7 1 2 7 9
3 6 9 5 8 4 1 8 9 2 9 5 9 0 8 6 5 8 9 9 9 4 7 1 9 8 3 8 4
2 2 - 2 - 1 - - - 1 - 1 4 1 - 8 3 9 - 6 9 1 4 8 - 7 - 7 7</p>
        <p>1 7 7 3 7 4 4
0 3 0 5 5 5 6 5 4 0 2 8 1 1 4 1 5 8 5 0 0 6 9
2 1 2 5 2 2 6 1 4 6 7 5 0 2 4 6 9 2 4 2 2 8 1 9 7 2
2 1 3 4 1 2 4 4 1 3 2 2 9 0 3 7 3 1 2 1 7 0 2 4 1 6 1 5 1
2 2 - - - 7 - - - - - 2 - 2 - 1 - 2 - 1 5 2 6 - - 4 - 1 7</p>
        <p>9 0 7 6 9 9 2
1 7 3 5 4 8 8 5 4 5 8 0 0 3 0 6 3 4 7 7 1
9 7 1 1 2 1 1 2 0 8 1 6 1 1 6 2 9 6 5 8 7 2 1 2 2 1 3
1 2 2 4 8 3 4 4 1 3 1 7 2 3 3 9 3 8 4 0 9 4 4 4 1 0 1 5 2
2 4 - - - 2 - - - - - 2 - 2 - 1 - 1 1 1 1 3 - - - 8 - 1</p>
        <p>4
9 9 2 9 5 8 0 0 7 5 6 2 4 1 9 1 5 1
9 6 6 1 7 6 6 0 2 5 8 4 9 9 9 1 2 7 5 7 8 5 5 9 7 8 5
0 9 1 2 4 4 2 2 1 2 1 2 4 2 1 9 2 2 9 8 2 2 2 2 6 5 7 1 1
2 2 - - - - - - - - - - - 1 - 3 - - - - 1 - - - - 3 - -</p>
        <p>3 2 5 5 8 1 7 0 6 0 3 0 5 5 0 6 3 0 4 1 5 2 9 4 9
9 74 87 37 2 2 4 1 9 9 9 9 4 8 2 7 4 3 1 3 0 2 2 4 4 6 0 3 4</p>
        <p>8 8 7 7 7 7 7 6 8 5 8 1 7 8 8 6 8 1 3 5 8 6 8 9 3
1 - - - - - - - - - - 6 - 3 - 3 - 5 - 1 - 9 6 - - 8 - 1 1</p>
        <p>3 6 8 4 4 4 5 2 2 1 6 5 6 0 3 6 0 4 5 7 3 8 4 1 2 5
8 45 35 15 3 5 6 0 3 5 3 8 2 5 6 1 3 8 2 4 6 0 5 0 5 7 3 9 3</p>
        <p>5 5 3 5 5 5 5 1 5 8 5 7 5 1 5 5 4 2 4 5 5 9 5 3 5
1 - - - - - - - - - - 1 - 5 - 4 - 1 - - - 4 - - - 4 - 4</p>
        <p>5 6 1 3 4 8
0 3 2 0 7 4 5 6 4 7 7 9 9 1 7 6 3 2 2 8 6 9 8 7 4 5
1 5 5 7 4 6 5 8 1 1 4 6 5 7 8 8 5 0 0 8 5 3 7 8 2 8 1 4
7 0 4 5 3 3 5 5 3 5 4 6 3 9 4 3 4 5 6 2 1 5 9 3 3 0 3 2 9
1 1 - - - - - - - - - 1 - 8 - 1 - 1 - 1 - 1 1 - - 8 - 1 6</p>
        <p>6 6 1 8 7 1 7 3 3 5 3 4 5 6 4 3 8 1 3 4 0 9 6 8 0 5
6 33 54 74 4 1 8 6 4 7 4 4 5 6 9 8 6 0 8 3 1 4 1 5 4 4 3 5 5</p>
        <p>4 5 4 4 4 4 4 4 4 8 4 4 4 5 4 4 3 2 4 4 4 9 4 4 4
1 - - - - - - - - - - 7 - 6 - 3 - - - - - 2 - - - 4 - -</p>
        <p>0 2 4 4 4 9 8
0 6 1 4 6 0 1 4 6 6 0 3 6 0 2 7 8 5 9 7 3 3 6
8 4 8 5 0 7 7 7 2 2 3 6 5 5 0 9 4 5 1 7 9 2 2 8 2 3 7 2
5 6 5 5 4 8 5 5 4 5 5 4 3 2 5 2 5 8 1 0 6 3 7 9 4 1 4 3 6
1 7 - - - 1 - - - - - 1 - 2 - 1 - 1 - 1 - 1 7 3 - 4 - 1 9</p>
        <p>8 4 9 5 9 3 6 8 9 5 1 2 2 9 9 4 4 3 5 7 9 0 4 8 2 2 8
4 13 33 33 1 5 4 3 0 3 1 2 8 9 4 3 3 4 5 0 3 1 0 3 1 6 0 2 1</p>
        <p>3 3 3 3 3 3 3 3 2 7 3 3 3 3 3 3 2 3 3 3 3 9 3 3 3
1 - - - - - - - - - - - - 2 - - - - - - - - - - - 4 - -
7 6 9 4 8 1 4
3 5 7 3 0 8 9 9 2 4 0 3 1 5 6 2 5 8 7 0 1
6 7 7 4 0 3 0 9 0 3 4 8 6 6 9 7 4 2 5 3 6 9 7 5 1 4 1 5
3 4 7 0 4 6 8 8 6 8 7 1 6 9 8 6 5 8 8 1 6 4 2 0 7 4 0 8 6
1 1 - 5 2 9 - - - 1 - 2 5 1 - 1 1 1 - 1 8 2 5 8 - 1 3 9 9</p>
        <p>0 1 6 4 7 8 5 9 5 5 6 8 1 8 6 4 4 3 9 7 7 2 1 5 0 0 4
2 29 92 62 0 1 7 6 8 9 9 5 0 1 9 8 8 0 9 8 5 5 3 6 0 5 9 8 9</p>
        <p>3 3 2 2 2 2 2 2 3 3 2 2 2 3 2 2 2 2 2 2 3 9 2 2 2
1 - - - - - - - - - - - - - - - - - - - - - - - - 2 - -
3 0 5 9 8 2 7 6 9 9 0 9 4 7 3 5 5 8 5 9 6 5 8 3 9 9
2 8 4 1 7 6 2 8 9 8 9 4 8 0 3 9 7 9 7 0 7 8 0 2 2 7 4 8
1 3 7 7 8 1 7 7 7 7 7 4 8 0 8 6 0 3 7 8 2 5 1 2 8 7 7 4 1
1 4 - - - - - - - - - 8 - 7 - 4 1 8 - 3 - 6 2 - - 9 - 6 5</p>
        <p>4 5
3 9 0 8 0 3 0 6 5 4 5 4 8 3 9 3 2 3 4 8 0 4 9 5 5
2 6 2 8 4 5 8 4 9 2 0 4 3 1 4 5 5 7 3 4 4 3 5 6 3 2
0 9 3 3 2 1 3 3 2 3 2 4 2 2 3 0 3 3 1 2 5 4 3 3 2 4 2 3 3
1 1 - - - - - - - - - - - 1 - 1 - - - - - 8 - - - 3 - -
0
8 3 5 8 8 1 7 8 7
5 0 0 8 8 5 5 2 2 6 7 7 4 0 4 5 4 1 7 8 5 9 0 7 9
1 0 5 6 5 8 5 0 0 0 6 4 6 4 9 9 6 0 4 1 1 9 7 1 0 3 7 0
0 1 0 5 1 9 9 6 2 1 3 5 2 4 1 5 7 1 1 1 2 1 9 6 2 5 1 6
9 2 - 1 6 2 - - - 3 - 2 4 1 - 1 4 9 - 8 1 2 6 8 - 1 1 1 9
3 2 7 3 4 5 5 0
8 5 1 4 9 6 1 0 2 0 4 3 8 7 5 8 9 4 0 7 9 9 7 6 0 6
7 0 4 3 6 2 1 1 6 8 8 1 0 0 3 4 0 2 2 1 8 6 9 8 2 1 0 8
2 7 7 6 0 7 7 6 7 6 7 8 5 7 5 8 5 7 4 3 5 5 1 6 5 6 3 2
8 1 - - - 2 - - - - - 1 1 1 - 1 3 1 - 6 1 1 7 4 - 6 - 1 1
0 3 2 5 5 0 6 0 5 6 1 3 8 9
7 4 8 1 2 6 0 3 1 2 7 4 4 1 9 0 3 7 7 1 1 0 9 0 3
8 8 7 3 7 9 3 9 2 8 5 4 7 8 7 1 5 4 3 9 1 3 8 8 9 5 3
0 3 2 1 2 5 6 0 6 3 2 8 3 2 9 5 6 2 1 1 5 5 8 1 3 9 3 5
6 6 - 1 - 8 - - 4 2 - 4 3 4 - 3 2 4 - 3 8 4 2 5 - 9 - 4 3
5 0 6 9 3 5 3 8
6 7 2 2 8 3 9 7 5 3 0 5 3 0 9 0 6 2 3 4 7 7 7 4 8 5
0 2 2 5 8 4 1 7 3 5 2 7 4 9 3 6 0 9 2 0 6 4 8 3 6 7 0 9
5 4 5 2 1 5 5 2 4 3 8 2 0 3 7 4 2 1 3 7 2 6 1 3 8 2 4 2
5 1 - - - - - - - - - 2 - 2 - 1 - 2 - 1 - 3 6 1 - 3 - 1 8</p>
        <p>1 0 4
3 3 0 5 2 4 5 1 4 3 4 3 8 1 4 8 5 7 5 3 4 2 9 4 5
9 1 5 7 4 6 4 7 5 0 6 1 5 6 5 4 6 8 4 0 6 4 2 2 3 8 2 9
4 6 6 5 7 6 6 5 6 6 7 6 0 6 0 6 4 6 5 3 4 4 1 6 3 5 1 2
4 1 - - - - - - - - - 9 - 1 - 1 - 6 - 2 - 1 8 2 - 8 - 4 2
9 3 2
5 4 7 1 1 2 9 6 4 3 4 7 2 6 7 3 8 7 7 2 7 0 5 5
8 7 0 2 0 6 1 7 7 7 7 2 0 9 9 9 2 8 0 6 4 7 2 2 0 6 3 2
5 8 3 9 1 8 8 8 3 8 1 1 4 8 6 8 6 8 0 2 5 6 2 9 3 8 9 4
3 1 - - - 5 - - - - - 1 4 8 - 5 2 7 - 4 - 1 2 4 - - - 5 4
3 4 2 5 7 2 0 6 8 2 7 9
8 1 4 7 3 8 3 1 1 3 5 6 9 0 9 6 4 4 3 8 1 8 1 8 8
2 7 0 9 3 0 9 0 5 4 6 1 0 2 3 8 0 0 5 4 0 1 8 8 7 7 6
1 3 6 4 0 6 5 2 2 3 9 5 3 3 4 8 5 3 0 8 3 2 6 1 0 1 2 2
2 4 - - - 8 - - - - - 3 3 4 - 3 1 4 4 3 4 5 2 4 - 1 - 3 3</p>
        <p>3 6 2 6 2 1
4 6 6 9 2 0 8 5 6 6 4 0 0 7 2 3 6 6 0 9 0 8 9 0
3 0 0 8 1 9 2 9 7 9 6 8 9 2 4 6 0 4 5 7 5 8 9 8 4 8 1
4 7 7 6 4 7 6 6 6 6 7 2 2 6 0 1 6 7 6 9 2 9 1 6 1 6 4 0
1 7 - - - 6 - - - - - 1 - 1 - 1 - 1 - 8 5 2 6 6 - 6 - 9 1
0 9 0 4 6 7 4 0 0 5 7 0 8 7 5 2 2 1 8 9 6 3 7 0 0 9 1 8 8
9 9 4 4 5 6 3 1 0 0 0 6 9 2 8 8 4 2 3 6 7 6 5 4 4 2 0 8
7 6 6 7 7 6 6 7 7 7 1 7 4 7 7 6 8 7 2 6 0 1 5 7 7 7 1 1
- - - - - - - - - - 1 - 3 - - - - 1 - -
l
e
The project underlying this paper has received funding from against every anomaly.
the European Union’s Horizon 2020 research and innovation
program under grant agreement No 723650 (MONSOON). This
paper reflects only the authors’ views and the commission is not
responsible for any use that may be made of the information it
contains.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Bryan</given-names>
            <surname>Auslander</surname>
          </string-name>
          , Kalyan Moy Gupta, and
          <string-name>
            <given-names>David W.</given-names>
            <surname>Aha</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>A comparative evaluation of anomaly detection algorithms for maritime video surveillance</article-title>
          .
          <source>In Proc. SPIE 8019</source>
          ,
          <string-name>
            <surname>Sensors</surname>
          </string-name>
          , and
          <string-name>
            <surname>Command</surname>
          </string-name>
          , Control, Communications, and
          <string-name>
            <surname>Intelligence</surname>
          </string-name>
          (C3I)
          <article-title>Technologies for Homeland Security and Homeland Defense X (SPIE Proceedings)</article-title>
          ,
          <string-name>
            <surname>Edward M. Carapezza</surname>
          </string-name>
          (Ed.).
          <source>SPIE</source>
          ,
          <volume>801907</volume>
          . https://doi.org/10.1117/12.883535
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Christian</given-names>
            <surname>Beecks</surname>
          </string-name>
          and
          <string-name>
            <given-names>Max</given-names>
            <surname>Berrendorf</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Optimal k-Nearest-Neighbor Query Processing via Multiple Lower Bound Approximations</article-title>
          .
          <source>In IEEE International Conference on Big Data, Big Data</source>
          <year>2018</year>
          , Seattle, WA, USA, December
          <volume>10</volume>
          -
          <issue>13</issue>
          ,
          <year>2018</year>
          . IEEE,
          <fpage>614</fpage>
          -
          <lpage>623</lpage>
          . https://doi.org/10.1109/BigData.
          <year>2018</year>
          .8622493
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Christian</given-names>
            <surname>Beecks</surname>
          </string-name>
          , Shreekantha Devasya, and
          <string-name>
            <given-names>Ruben</given-names>
            <surname>Schlutter</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Machine Learning for Enhanced Waste Quantity Reduction: Insights from the MONSOON Industry 4.0 Project. In Machine Learning for Cyber Physical Systems</article-title>
          , Jürgen Beyerer,
          <string-name>
            <given-names>Christian</given-names>
            <surname>Kühnert</surname>
          </string-name>
          , and Oliver Niggemann (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1-
          <fpage>6</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Christian</given-names>
            <surname>Beecks</surname>
          </string-name>
          and
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Graß</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Multi-step threshold algorithm for eficient feature-based query processing in large-scale multimedia databases</article-title>
          .
          <source>In 2016 IEEE International Conference on Big Data, BigData 2016</source>
          ,
          <string-name>
            <surname>Washington</surname>
            <given-names>DC</given-names>
          </string-name>
          , USA, December 5-
          <issue>8</issue>
          ,
          <year>2016</year>
          . IEEE,
          <fpage>596</fpage>
          -
          <lpage>605</lpage>
          . https://doi.org/10.1109/BigData.
          <year>2016</year>
          .7840652
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Christian</given-names>
            <surname>Beecks</surname>
          </string-name>
          , Alexander Grass, and
          <string-name>
            <given-names>Shreekantha</given-names>
            <surname>Devasya</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Metric Indexing for Eficient Data Access in the Internet of Things</article-title>
          .
          <source>In IEEE International Conference on Big Data, Big Data</source>
          <year>2018</year>
          , Seattle, WA, USA, December
          <volume>10</volume>
          -
          <issue>13</issue>
          ,
          <year>2018</year>
          . IEEE,
          <fpage>5132</fpage>
          -
          <lpage>5136</lpage>
          . https://doi.org/10.1109/BigData.
          <year>2018</year>
          .8622387
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Christian</given-names>
            <surname>Beecks</surname>
          </string-name>
          , Stefen Kirchhof, and
          <string-name>
            <given-names>Thomas</given-names>
            <surname>Seidl</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Signature matching distance for content-based image retrieval</article-title>
          .
          <source>In International Conference on Multimedia Retrieval, ICMR'13</source>
          , Dallas, TX, USA, April
          <volume>16</volume>
          -
          <issue>19</issue>
          ,
          <year>2013</year>
          . ACM,
          <volume>41</volume>
          -
          <fpage>48</fpage>
          . https://doi.org/10.1145/2461466.2461474
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Markus</given-names>
            <surname>Breunig</surname>
          </string-name>
          ,
          <string-name>
            <surname>Hans-Peter Kriegel</surname>
            , Raymond T. Ng, and
            <given-names>Jörg</given-names>
          </string-name>
          <string-name>
            <surname>Sander</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>LOF: Identifying Density-Based Local Outliers</article-title>
          .
          <source>In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. ACM</source>
          ,
          <volume>93</volume>
          -
          <fpage>104</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Arno</given-names>
            <surname>Candel</surname>
          </string-name>
          ,
          <string-name>
            <surname>Erin</surname>
            <given-names>LeDell</given-names>
          </string-name>
          , Viraj Parmar, and
          <string-name>
            <given-names>Anisha</given-names>
            <surname>Arora</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Deep Learning with H2O</article-title>
          . http://docs.h2o.ai/h2o/latest-stable/h2o-docs/booklets/ DeepLearningBooklet.pdf. http://docs.h2o.ai/h2o/latest-stable/h2o-docs/ booklets/DeepLearningBooklet.pdf (Accessed on 01/08/
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Varun</given-names>
            <surname>Chandola</surname>
          </string-name>
          , Arindam Banerjee, and
          <string-name>
            <given-names>Vipin</given-names>
            <surname>Kumar</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Anomaly Detection: A Survey</article-title>
          .
          <source>ACM Comput. Surv</source>
          .
          <volume>41</volume>
          ,
          <issue>3</issue>
          ,
          <string-name>
            <surname>Article 15</surname>
          </string-name>
          (
          <year>July 2009</year>
          ),
          <volume>58</volume>
          pages. https://doi.org/10.1145/1541880.1541882
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>R.</given-names>
            <surname>Domingues</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Buonora</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Senesi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Thonnard</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>An Application of Unsupervised Fraud Detection to Passenger Name Records</article-title>
          .
          <source>In 2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshop (DSN-W)</source>
          .
          <volume>54</volume>
          -
          <fpage>59</fpage>
          . https://doi.org/10.1109/DSN-W.
          <year>2016</year>
          .21
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>David</given-names>
            <surname>Duvenaud</surname>
          </string-name>
          , James Robert Lloyd, Roger Grosse, Joshua B.
          <string-name>
            <surname>Tenenbaum</surname>
            , and
            <given-names>Zoubin</given-names>
          </string-name>
          <string-name>
            <surname>Ghahramani</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Structure Discovery in Nonparametric Regression through Compositional Kernel Search</article-title>
          . arXiv:arXiv:
          <fpage>1302</fpage>
          .
          <fpage>4922</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Eleazar</surname>
            <given-names>Eskin</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Andrew</given-names>
            <surname>Arnold</surname>
          </string-name>
          , Michael Prerau, Leonid Portnoy, and
          <string-name>
            <given-names>Sal</given-names>
            <surname>Stolfo</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>A Geometric Framework for Unsupervised Anomaly Detection</article-title>
          . In Applications of Data Mining in Computer Security, Daniel Barbará and Sushil Jajodia (Eds.).
          <source>Advances in Information Security</source>
          ,
          <fpage>1568</fpage>
          -
          <lpage>2633</lpage>
          , Vol.
          <volume>6</volume>
          .
          <string-name>
            <surname>Springer</surname>
            <given-names>US</given-names>
          </string-name>
          and Imprint and Springer, Boston, MA,
          <fpage>77</fpage>
          -
          <lpage>101</lpage>
          . https://doi.org/10.1007/ 978-1-
          <fpage>4615</fpage>
          -0953-0{_}
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Markus</given-names>
            <surname>Goldstein</surname>
          </string-name>
          and
          <string-name>
            <given-names>Seiichi</given-names>
            <surname>Uchida</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>A Comparative Evaluation of Unsupervised Anomaly Detection Algorithms for Multivariate Data</article-title>
          . (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Alexander</surname>
            <given-names>Graß</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Christian</given-names>
            <surname>Beecks</surname>
          </string-name>
          , and Jose Angel Carvajal Soto.
          <year>2019</year>
          .
          <article-title>Unsupervised Anomaly Detection in Production Lines</article-title>
          .
          <source>In Machine Learning for Cyber Physical Systems</source>
          , Jürgen Beyerer,
          <string-name>
            <given-names>Christian</given-names>
            <surname>Kühnert</surname>
          </string-name>
          , and Oliver Niggemann (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg,
          <fpage>18</fpage>
          -
          <lpage>25</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Yunseong</surname>
            <given-names>Hwang</given-names>
          </string-name>
          , Anh Tong, and
          <string-name>
            <given-names>Jaesik</given-names>
            <surname>Choi</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Automatic Construction of Nonparametric Relational Regression Models for Multiple Time Series</article-title>
          .
          <source>In ICML 2016: Proceedings of the 33rd International Conference on Machine Learning (Proceedings of Machine Learning Research)</source>
          ,
          <source>Maria Florina Balcan and Kilian Q. Weinberger (Eds.)</source>
          , Vol.
          <volume>48</volume>
          . PLMR,
          <fpage>3030</fpage>
          -
          <lpage>3039</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Fei</given-names>
            <surname>Tony</surname>
          </string-name>
          <string-name>
            <given-names>Liu</given-names>
            , Kai Ming Ting, and
            <surname>Zhi-Hua Zhou</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Isolation Forest</article-title>
          . In Eighth IEEE International Conference on Data Mining,
          <year>2008</year>
          ,
          <string-name>
            <given-names>Fosca</given-names>
            <surname>Giannotti</surname>
          </string-name>
          (Ed.). IEEE, Piscataway, NJ,
          <fpage>413</fpage>
          -
          <lpage>422</lpage>
          . https://doi.org/10.1109/ICDM.
          <year>2008</year>
          .17
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>James</given-names>
            <surname>Robert</surname>
          </string-name>
          <string-name>
            <surname>Lloyd</surname>
          </string-name>
          , David Duvenaud,
          <string-name>
            <given-names>Roger</given-names>
            <surname>Grosse</surname>
          </string-name>
          , Joshua B.
          <string-name>
            <surname>Tenenbaum</surname>
            , and
            <given-names>Zoubin</given-names>
          </string-name>
          <string-name>
            <surname>Ghahramani</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Automatic Construction and Natural-Language Description of Nonparametric Regression Models</article-title>
          .
          <source>arXiv:arXiv:1402.4304</source>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Fabian</surname>
            <given-names>Pedregosa</given-names>
          </string-name>
          , Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          , Ron Weiss, Vincent Dubourg, Jake Vanderplas, Alexandre Passos, David Cournapeau,
          <string-name>
            <given-names>Matthieu</given-names>
            <surname>Brucher</surname>
          </string-name>
          , Matthieu Perrot, and
          <string-name>
            <given-names>Édouard</given-names>
            <surname>Duchesnay</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Scikit-learn: Machine Learning in Python</article-title>
          .
          <source>J. Mach. Learn. Res</source>
          .
          <volume>12</volume>
          (
          <issue>Nov</issue>
          .
          <year>2011</year>
          ),
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          . http://dl.acm.org/citation.cfm?id=
          <volume>1953048</volume>
          .
          <fpage>2078195</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Clifton</surname>
            <given-names>Phua</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vincent</surname>
            <given-names>C. S.</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>Kate</given-names>
          </string-name>
          <string-name>
            <surname>Smith-Miles</surname>
          </string-name>
          , and
          <string-name>
            <surname>Ross</surname>
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Gayler</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>A Comprehensive Survey of Data Mining-based Fraud Detection Research</article-title>
          .
          <source>CoRR abs/1009</source>
          .6119 (
          <year>2010</year>
          ). arXiv:
          <volume>1009</volume>
          .6119 http://arxiv.org/abs/1009.6119
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Carl</given-names>
            <surname>Edward Rasmussen and Christopher K. I. Williams</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>Gaussian Processes for Machine Learning (Adaptive Computation And Machine Learning)</article-title>
          . The MIT Press.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>David</given-names>
            <surname>Renaudie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Maria A.</given-names>
            <surname>Zuluaga</surname>
          </string-name>
          , and
          <string-name>
            <surname>Rodrigo</surname>
          </string-name>
          Acuna-Agost.
          <year>2018</year>
          .
          <article-title>Benchmarking Anomaly Detection Algorithms in an Industrial Context: Dealing with Scarce Labels and Multiple Positive Types</article-title>
          .
          <source>In IEEE International Conference on Big Data</source>
          .
          <fpage>1227</fpage>
          -
          <lpage>1236</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Peter J Rousseeuw</surname>
          </string-name>
          .
          <year>1984</year>
          .
          <article-title>Least median of squares regression</article-title>
          .
          <source>Journal of the American statistical association 79</source>
          ,
          <issue>388</issue>
          (
          <year>1984</year>
          ),
          <fpage>871</fpage>
          -
          <lpage>880</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Bernhard</surname>
            <given-names>Schölkopf</given-names>
          </string-name>
          , John C. Platt, John C. Shawe-Taylor, Alex J.
          <string-name>
            <surname>Smola</surname>
          </string-name>
          , and
          <string-name>
            <surname>Robert</surname>
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Williamson</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Estimating the Support of a High-Dimensional Distribution</article-title>
          .
          <source>Neural Comput</source>
          .
          <volume>13</volume>
          ,
          <issue>7</issue>
          (
          <year>July 2001</year>
          ),
          <fpage>1443</fpage>
          -
          <lpage>1471</lpage>
          . https://doi.org/10. 1162/089976601750264965
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tavallaee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Stakhanova</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Ghorbani</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Toward Credible Evaluation of Anomaly-Based Intrusion-Detection Methods</article-title>
          .
          <source>IEEE Transactions on Systems, Man, and Cybernetics</source>
          , Part C (
          <article-title>Applications</article-title>
          and Reviews)
          <volume>40</volume>
          ,
          <issue>5</issue>
          (
          <year>September 2010</year>
          ),
          <fpage>516</fpage>
          -
          <lpage>524</lpage>
          . https://doi.org/10.1109/TSMCC.
          <year>2010</year>
          .2048428
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>