<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">51221</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2024.051221</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Anomaly Detection in Imbalanced Encrypted Traffic with Few Packet Metadata-Based Feature Extraction</article-title>
<alt-title alt-title-type="left-running-head">Anomaly Detection in Imbalanced Encrypted Traffic with Few Packet Metadata-Based Feature Extraction</alt-title>
<alt-title alt-title-type="right-running-head">Anomaly Detection in Imbalanced Encrypted Traffic with Few Packet Metadata-Based Feature Extraction</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Kim</surname><given-names>Min-Gyu</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Kim</surname><given-names>Hwankuk</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><email>rinyfeel@kookmin.ac.kr</email></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Financial Information Security, Kookmin University</institution>, <addr-line>Seoul, 02707</addr-line>, <country>Republic of Korea</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Information Security Cryptography Mathematics, Kookmin University</institution>, <addr-line>Seoul, 02707</addr-line>, <country>Republic of Korea</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Hwankuk Kim. Email: <email>rinyfeel@kookmin.ac.kr</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2024</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>20</day><month>8</month><year>2024</year></pub-date>
<volume>141</volume>
<issue>1</issue>
<fpage>585</fpage>
<lpage>607</lpage>
<history>
<date date-type="received">
<day>29</day>
<month>2</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>19</day>
<month>6</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2024 The Authors.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_51221.pdf"></self-uri>
<abstract>
<p>In the IoT (Internet of Things) domain, the increased use of encryption protocols such as SSL/TLS, VPN (Virtual Private Network), and Tor has led to a rise in attacks leveraging encrypted traffic. While research on anomaly detection using AI (Artificial Intelligence) is actively progressing, the encrypted nature of the data poses challenges for labeling, resulting in data imbalance and biased feature extraction toward specific nodes. This study proposes a reconstruction error-based anomaly detection method using an autoencoder (AE) that utilizes packet metadata excluding specific node information. The proposed method omits biased packet metadata such as IP and Port and trains the detection model using only normal data, leveraging a small amount of packet metadata. This makes it well-suited for direct application in IoT environments due to its low resource consumption. In experiments comparing feature extraction methods for AE-based anomaly detection, we found that using flow-based features significantly improves accuracy, precision, F1 score, and AUC (Area Under the Receiver Operating Characteristic Curve) score compared to packet-based features. Additionally, for flow-based features, the proposed method showed a 30.17% increase in F1 score and improved false positive rates compared to Isolation Forest and OneClassSVM. Furthermore, the proposed method demonstrated a 32.43% higher AUC when using packet features and a 111.39% higher AUC when using flow features, compared to previously proposed oversampling methods. This study highlights the impact of feature extraction methods on attack detection in imbalanced, encrypted traffic environments and emphasizes that the one-class method using AE is more effective for attack detection and reducing false positives compared to traditional oversampling methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>One-class anomaly detection</kwd>
<kwd>feature extraction</kwd>
<kwd>auto-encoder</kwd>
<kwd>encrypted traffic</kwd>
<kwd>CICIoT2023</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Institute of Information &#x0026; Communications Technology</funding-source>
<award-id>RS-2023-00235509</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>With the advancement of mobile communication technologies such as 5G and the upcoming 6G, the connectivity of IoT devices is steadily increasing. Especially, IoT devices and sensors installed on vehicles [<xref ref-type="bibr" rid="ref-1">1</xref>], smart UAVs (Unmanned Aerial Vehicles) [<xref ref-type="bibr" rid="ref-2">2</xref>], smart infrastructure, and similar platforms may contain sensitive information. Therefore, using SSL/TLS is crucial in mitigating risks such as data exposure and man-in-the-middle attacks. According to Google&#x2019;s transparency report, as of 18 February, 2024, the HTTPS traffic rate through Google for websites and services has reached 96%. Consequently, research on the utilization of SSL/TLS in mobile applications and web browsers is underway worldwide [<xref ref-type="bibr" rid="ref-3">3</xref>&#x2013;<xref ref-type="bibr" rid="ref-5">5</xref>]. Additionally, IoT devices are also beginning to adopt SSL/TLS protocols.</p>
<p>However, there is concern that attackers could exploit the SSL/TLS protocol to perform attacks using hidden data on IoT (Internet of Things) devices that provide web-based services [<xref ref-type="bibr" rid="ref-6">6</xref>]. From a network security perspective, a significant issue with encryption protocols is the inability to view traffic payload data. Therefore, traditional rule-based attack detection and DPI (Deep Packet Inspection) techniques, commonly used for non-encrypted traffic, cannot be applied.</p>
<p>As a result, most SSL/TLS inspection solutions employ SSL/TLS proxy servers. Inspection through SSL/TLS proxy servers involves decrypting encrypted traffic, examining packet data, re-encrypting it, and forwarding it. However, this process raises concerns about privacy breaches. Additionally, decrypting and encrypting traffic can introduce overhead and affect network speed. Moreover, collecting encrypted traffic data in real-world environments poses challenges. The encryption of traffic poses challenges for data labeling, causing difficulties in data collection for ML/DL (Machine Learning/Deep Learning) model training.</p>
<p>Particularly in the case of IoT data, privacy concerns make data collection challenging [<xref ref-type="bibr" rid="ref-7">7</xref>]. This ultimately leads to imbalanced or insufficient training data, impacting the generalization and classification performance of the models. Efforts are being made across various fields to address this issue, including the utilization of data generation models [<xref ref-type="bibr" rid="ref-8">8</xref>] and model combination techniques.</p>
<p>To analyze encrypted traffic without decryption, researchers are approaching it from three main perspectives: (1) utilizing packet metadata, (2) utilizing encrypted payload-based feature extraction data, and (3) utilizing deep learning-based raw packet feature extraction data. Packet metadata involves extracting data from packet headers, similar to the analysis of non-encrypted data, to generate statistical features based on network behavior at the packet or flow level. Encrypted payload-based feature extraction involves methods using entropy [<xref ref-type="bibr" rid="ref-9">9</xref>] or vectorization with deep learning. Using raw packets themselves is mainly applied to service classification problems, often by vectorizing through DNS (Domain Name System) networks or transforming into images using convolutional neural network (CNN) models [<xref ref-type="bibr" rid="ref-10">10</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<p>To analyze encrypted traffic without decryption, this paper compared two types of feature extraction methods using an autoencoder-based one-class anomaly detection (OC-AD) approach. Feature extraction involved using a small amount of packet metadata as learning vectors and summarizing a large amount of rows using a sliding-window algorithm. Additionally, to address the issue of class imbalance caused by a significantly larger amount of normal data, this paper adopted a method of training the Autoencoder using only normal data. Furthermore, in the feature extraction stage, this method did not use metadata representing specific node information such as IP and Port.</p>
<p>Especially, due to the limited number of nodes used in creating the training data, the dataset contains a small number of unique IPs and Ports, unlike real-world scenarios. Therefore, the model may suffer from bias towards the IPs and Ports present in the training data, making it unsuitable for real-world applications. Additionally, our proposed model uses the reconstruction error of the Autoencoder for anomaly detection, enabling an explanation of the reasons for anomalies detected. This addresses the issue of unexplainable decisions in traditional deep learning-based classification and anomaly detection models. The contributions of our work are as follows:
<list list-type="order">
<list-item><p>We propose an autoencoder-based one-class anomaly detection (OC-AD) model that learns only from normal data and utilizes the reconstruction error for explainable anomaly detection, tailored for environments with limited encrypted attack data.</p></list-item>
<list-item><p>The results demonstrate that when using a small amount of packet metadata for feature extraction, flow-based feature extraction methods are more effective for anomaly detection compared to packet-based methods.</p></list-item>
<list-item><p>Compare the differences in anomaly detection performance when using the same feature extraction method for two types of attacks targeting IoT devices with encrypted traffic.</p></list-item>
<list-item><p>When compared to previously proposed oversampling methods, the proposed model demonstrated greater effectiveness in both attack detection and reducing false positives.</p></list-item>
</list></p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<sec id="s2_1">
<label>2.1</label>
<title>Anomaly Detection Approaches</title>
<p><bold>Statistical-based approach.</bold> This approach utilizes metadata obtained from packets to generate statistical features for model learning and detection.</p>
<p>Zhang et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] focused their research on feature extraction and traffic clustering using a sliding window algorithm with traffic distribution data. Their study demonstrated the ability to obtain more clustering distribution features compared to traditional grid-based traffic clustering methods.</p>
<p>Yan et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] demonstrated an effective classification of Tor network flows using time window-based flow segmentation and bidirectional statistical feature extraction. The classification obtained using packet length, fixed-length intervals, entropy, and similar parameters exhibited superior speed and recognition rates compared to deep learning methods.</p>
<p>Dahiya [<xref ref-type="bibr" rid="ref-14">14</xref>] demonstrated DDoS (Distributed Denial of Service) detection in 5G systems using only statistical features and showed up to a 22.73% improvement compared to traditional models. This research utilized higher-order statistical features, in addition to basic statistical metrics like mean, median, and standard deviation (SD). Furthermore, they proposed entropy features considering the relationship between data points.</p>
<p>Yang et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] generated packet-level and flow-level features by utilizing packet metadata and flow metadata. It is noteworthy that they focused on considering both levels of network flow, employing a total of 249 statistical features. However, the sheer number of features may pose challenges in terms of resource consumption for data processing and storage, making it difficult to directly apply in the IoT field.</p>
<p>Applying the slicing window algorithm to network traffic data can better represent behavior compared to a mere sequence of consecutive packets. While the statistical characteristics of individual features are important, this algorithm is particularly useful for observing the overall behavior of network traffic.</p>
<p><bold>Deep learning-based approach.</bold> This approach involves training models directly on data features through neural networks and being explored in various fields to enable models to extract and learn features directly from raw data without preprocessing [<xref ref-type="bibr" rid="ref-16">16</xref>].</p>
<p>In papers [<xref ref-type="bibr" rid="ref-10">10</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>], 2D CNN models were utilized for service classification of encrypted traffic. While CNN-based methods are helpful for pattern extraction, they come with the drawback of requiring significant computing power or large memory space at once. To be practical, lighter feature extraction methods and utilization strategies are needed.</p>
<p>On the other hand, Fatani et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] proposed a deep learning-based feature extraction and feature selection algorithm for intrusion detection and malicious identification in IoT environments. They employed a convolutional neural network (CNN) consisting of two 1D convolution layers and four fully connected (FC) layers to perform feature extraction from raw input packets.</p>
<p>Additionally, in the paper [<xref ref-type="bibr" rid="ref-11">11</xref>], 1D CNN was used for service identification of encrypted traffic. When compared to previous image-based research on various identification problems, their proposed model demonstrated superior effectiveness in identifying encryption types, Tor traffic types, and Non-VPN (Virtual Private Network) traffic types.</p>
<p><bold>Autoencoder-based approach.</bold> In many cases, supervised learning-based algorithms have been widely used in traditional machine learning-based detection. However, labeling real-world encrypted data as normal or abnormal entails significant costs, making it challenging to collect and label data.</p>
<p>To address these limitations, research is being conducted on anomaly detection using Autoencoder deep learning structures with self-supervised learning algorithms. Yao et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] performed unsupervised anomaly detection using feature extraction with Variational Auto-Encoder (VAE). They found that the VAE-based feature extraction method outperformed other methods, including Autoencoder (AE) and Kernel Principal Component Analysis (KPCA).</p>
<p>Ruikun et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] proposed a method for determining discriminative thresholds using reconstruction errors by detecting the density of compressed features in the hidden layer of a Denoising Autoencoder. Despite employing a complex model, this method demonstrated superiority over other Autoencoder models.</p>
<p>Xu et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] introduced an outlier removal method and compared the performance of reconstruction error functions to alleviate bias caused by data imbalance using a 5-layer Autoencoder. This led to improved anomaly detection performance on the NSL-KDD dataset.</p>
<p>Many studies utilize Autoencoders for data preprocessing. However, reference [<xref ref-type="bibr" rid="ref-19">19</xref>] standed out by utilizing the reconstruction error data generated during the training process of Autoencoders. The reconstruction error, which represents the difference between the data the model was trained on and the reconstructed data, can be crucial for anomaly detection.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>ML/DL Training in Imbalanced Data</title>
<p><bold>Oversampling approach.</bold> The most actively researched oversampling method involves using generative adversarial network (GAN)-based algorithms.</p>
<p>Papers [<xref ref-type="bibr" rid="ref-21">21</xref>&#x2013;<xref ref-type="bibr" rid="ref-24">24</xref>] utilized GAN-based variant models to address imbalanced data. Well-designed GAN variant algorithms can effectively address issues caused by imbalanced data more efficiently than traditional oversampling techniques like the synthetic minority oversampling technique (SMOTE).</p>
<p>In paper [<xref ref-type="bibr" rid="ref-25">25</xref>], a method was proposed to control the data generation mode of Conditional GAN using application types of traffic to address the imbalance problem in encrypted traffic data. Although GAN-based algorithms demonstrate overwhelmingly superior performance among generative models, they may face issues with unstable data generation due to non-convergence oscillation or mode collapse during training. Additionally, the problem of generating incorrect data arises when fake data is mixed with real data for oversampling [<xref ref-type="bibr" rid="ref-26">26</xref>].</p>
<p>In paper [<xref ref-type="bibr" rid="ref-27">27</xref>], a method was proposed to input the latent variables of an autoencoder into a linear separator for oversampling, showing robustness against overfitting due to the linear separator.</p>
<p>In paper [<xref ref-type="bibr" rid="ref-28">28</xref>], attention was drawn to the time-consuming aspect of most oversampling methods, particularly concerning the use of k-nearest neighbors. They significantly reduced computation time by calculating the absolute values between the minimum and maximum values of each feature of the minority class, achieving similar effects to SMOTE.</p>
<p><bold>Undersampling approach.</bold> Undersampling is a method that reduces the data of the majority class, opposite to oversampling. To accomplish this, it is crucial to establish criteria for determining which data from the majority class to remove.</p>
<p>Papers [<xref ref-type="bibr" rid="ref-29">29</xref>,<xref ref-type="bibr" rid="ref-30">30</xref>] proposed two methods for undersampling: random undersampling (RUS), which randomly removes data, and removing data from high-density clusters in the majority class to minimize information loss. RUS showed good performance when used with deep learning classifiers, while the method of removing data from high-density clusters outperformed traditional undersampling methods when using ML/DL classifiers on various datasets.</p>
<p><bold>One-class training approach.</bold> The one-class training approach is advantageous for imbalanced data because it only uses one class for training. Additionally, it is effective in saving time and cost [<xref ref-type="bibr" rid="ref-31">31</xref>].</p>
<p>In the paper [<xref ref-type="bibr" rid="ref-32">32</xref>], various variations of autoencoders were evaluated and compared as classifiers. A total of 5 autoencoder variant models performed classification on IDS (Intrusion Detection System) data. As a result, all AE classifiers showed an F1 score of 88 or higher, indicating effectiveness in building unsupervised learning-based IDS.</p>
<p>Furthermore, papers [<xref ref-type="bibr" rid="ref-33">33</xref>,<xref ref-type="bibr" rid="ref-34">34</xref>] proposed methods to ensemble one-class classifiers. In particular, Krawczyk et al. [<xref ref-type="bibr" rid="ref-33">33</xref>] suggested a dynamic ensemble method to address multi-class classification problems. It applied a threshold to discard incompetent classifiers among multiple classifiers. It demonstrated stable performance across 22 different datasets.</p>
<p>Vaiyapuri et al. [<xref ref-type="bibr" rid="ref-32">32</xref>] demonstrated the possibility of using Autoencoders as classifiers. Additionally, One-Class training is advantageous in highly imbalanced datasets as it allows training with only one class. Moreover, the algorithms used for One-Class training are mostly unsupervised learning algorithms, which makes them well-suited for handling unseen data.</p>
<p>This study employed a self-supervised model, the Autoencoder, to overcome the challenge of labeling encrypted data. Furthermore, to address the issue of class imbalance in encrypted attack data, an Autoencoder-based one-class learning approach was utilized.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Method</title>
<sec id="s3_1">
<label>3.1</label>
<title>Feature Extraction Methods</title>
<p>This section explains the processes of two statistical feature extraction methods for network anomaly detection from TCP (Transmission Control Protocol) traffic data containing SSL/TLS protocol packets. Both of these feature extraction methods utilize identical packet metadata for feature extraction. Furthermore, the quantity of features extracted was minimized to utilize as little computational resources as possible, making it suitable for application in IoT environments.</p>
<p><bold>Packet-based feature extraction:</bold> This method involves extracting statistical features on a packet-by-packet basis from the PCAP (Packet Capture) files. This process was performed in two steps:</p> <p>First, we stored the metadata of individual packets. The metadata used in this step included information on the packet itself, such as frame size and epoch time, as well as transmission status information (e.g., TCP flags) and encrypted user data information (e.g., TLS application data length). We excluded information that could specifically identify attacking nodes, such as IP addresses, to prevent bias during model training.</p> <p>Second, we extracted statistical features for every set of 10 packets using their metadata and the 10-sliding window algorithm. <xref ref-type="table" rid="table-1">Table 1</xref> lists statistical features based on packets that were ultimately extracted through these two steps.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Packet-based features</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Feature</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>Packet size</td>
<td>Packet frame size</td>
</tr>
<tr>
<td>IAT (Inter arrival time)</td>
<td>The epoch time difference with the previous packet</td>
</tr>
<tr>
<td>Ack value</td>
<td>Ack flag value</td>
</tr>
<tr>
<td>Syn value</td>
<td>Syn flag value</td>
</tr>
<tr>
<td>Fin value</td>
<td>Fin flag value</td>
</tr>
<tr>
<td>Psh value</td>
<td>Psh flag value</td>
</tr>
<tr>
<td>Rst value</td>
<td>Rst flag value</td>
</tr>
<tr>
<td>App data size</td>
<td>TLS application data length</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><bold>Flow-based feature extraction:</bold> This method involved extracting features from the accumulated packet information flowing in one direction between two endpoints from the PCAP file. This process was performed in three steps:</p> <p>First, we stored metadata of individual packets, categorized by flow, based on a 5-tuple. The metadata used in this step were the same as those used in packet-based feature extraction.</p> <p>Second, we extracted statistical features using the accumulated metadata for flows in which new metadata were added.</p> <p>Third, we extracted statistical features for every set of 10 packets using their metadata and the 10-sliding window algorithm. <xref ref-type="table" rid="table-2">Table 2</xref> lists the final statistical features based on flows that extracted through these two steps. Additionally, in flow-based feature extraction, we considered the direction of packet flow within a single flow, extracting features related to inbound and outbound traffic.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Flow-based features</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Feature</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>Packet size</td>
<td>Packet frame size mean in flow</td>
</tr>
<tr>
<td>IAT</td>
<td>The epoch time difference with the previous packet in the same flow</td>
</tr>
<tr>
<td>Outbound packet size</td>
<td>Outbound packet size mean in a flow</td>
</tr>
<tr>
<td>Inbound packet size</td>
<td>Inbound packet size mean in a flow</td>
</tr>
<tr>
<td>Transmission rate</td>
<td>Rate of packet transmission in a flow</td>
</tr>
<tr>
<td>Outbound packet rate</td>
<td>Rate of packet outbound transmission in a flow</td>
</tr>
<tr>
<td>Inbound packet rate</td>
<td>Rate of packet inbound transmission in a flow</td>
</tr>
<tr>
<td>Ack count</td>
<td>Number of packets with ack flag set in the same flow</td>
</tr>
<tr>
<td>Syn count</td>
<td>Number of packets with syn flag set in the same flow</td>
</tr>
<tr>
<td>Fin count</td>
<td>Number of packets with fin flag set in the same flow</td>
</tr>
<tr>
<td>Psh count</td>
<td>Number of packets with psh flag set in the same flow</td>
</tr>
<tr>
<td>Rst count</td>
<td>Number of packets with rst flag set in the same flow</td>
</tr>
<tr>
<td>App data size</td>
<td>TLS application data length in a flow</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experiments</title>
<sec id="s4_1">
<label>4.1</label>
<title>Setup and Work Flow</title>
<p><bold>Dataset.</bold> This study utilized the CIC IoT Dataset 2023 (CICIoT2023), created by the Canadian Institute for Cyber-security (CIC) at the University of New Brunswick in Canada. This dataset provides data from real-time traffic generated by various attacks attempted in an actual IoT environment. It includes original PCAP files with traffic data and CSV files containing extracted features from the packet capture (PCAP) files.</p>
<p>Additionally, it provides example code in an ipynb file for ML-based multi-class classification using this dataset, as well as source code and tool descriptions used for data feature extraction. The dataset includes 33 types of IoT attacks categorized into 7 classes. Among them, encrypted traffic of browser hijacking and SQL (Structured Query Language) injection attacks are included.</p>
<p>This paper utilized benign traffic composed within the dataset for model training. Additionally, to measure the anomaly detection performance of models trained based on normal data, both browser hijacking and SQL injection attacks were employed as different types of attacks. As depicted on the left side of <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, the Benign PCAP and Attack PCAP provided by the CICIoT2023 dataset are prepared as training and testing datasets through three steps.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Experiments workflow</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-1.tif"/>
</fig>
<p>Step (1): Select traffic related to devices involved in providing web-based services from IoT devices. Step (2): Use Python&#x2019;s Scapy library to extract metadata for each protocol layer of the packets. Exclude specific node unique data like IP and Port. Extracted metadata is transformed into feature vectors. Feature data is converted into CSV format, and the averaged values for every 10 rows are saved into files. Step (3): Distribute the data to construct datasets for training and evaluation.</p>
<p>The train set comprises 50% of benign data, the validation set includes 25% of benign data, and the test set consists of the remaining 25% of benign data and 100% of malicious data. The actual amount of data used is as shown in <xref ref-type="table" rid="table-3">Table 3</xref>, with 39,119 rows for Benign traffic, 1739 rows for browser hijacking, and 1699 rows for SQL injection.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Traffic data summary</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Traffic</th>
<th>Packet rows</th>
<th>Csv rows</th>
</tr>
</thead>
<tbody>
<tr>
<td>Benign</td>
<td>391,187</td>
<td>39,119</td>
</tr>
<tr>
<td>Browser Hijacking</td>
<td>17,385</td>
<td>1739</td>
</tr>
<tr>
<td>SQL injection</td>
<td>16,981</td>
<td>1699</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><bold>One-class anomaly detection.</bold> The anomaly detection process, as illustrated on the right side of <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, consists of five main steps. Step (1): Normalize the range of all datasets using StandardScaling and MinMaxScaling. Step (2): Train the Autoencoder (AE) using the Train Set containing only benign data. The AE aims to minimize the reconstruction error between the output data, obtained after compression and de-compression, and the input data, which is the benign data. Step (3): Input the Test Set, containing a mixture of benign and malicious data, into the trained AE.</p>

<p>The AE reconstructs the input similar to the benign data used during training. However, the reconstructed output for the malicious data input will have significant errors compared to the benign data. Step (4): Select the threshold that maximizes the F1 score based on the reconstruction errors of both benign and malicious data from the Test Set. Step (5): Detect anomalies using the selected optimal threshold.</p>
<p><bold>Auto-encoder architecture.</bold> The layers of the AE model consisted of four Dense layers and two Dropout layers, as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The number of units in each layer of the encoder gradually decreased by 25% from the number of input features to a maximum reduction of 50%. In contrast, the number of units in each layer of the decoder increased by 25%, mirroring the AE&#x2019;s input feature count to maintain consistency.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Auto-encoder layer architecture for experimental</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-2.tif"/>
</fig>
<p><bold>Training setting.</bold> The AE was trained with a batch size of 32, and shuffle set to false. The number of epochs was set to 20, based on manual determination of when the validation loss did not improve for more than 4 consecutive epochs. Only the same normal data was used for both input X and output Y, with separately segmented validation data.</p>
<p><bold>Layer hyperparameter tuning.</bold> Manual parameter optimization was conducted for the activation function of the hidden layers, the activation function of the output layer, the loss function, and the optimizer of the Autoencoder. The parameters yielding the smallest validation data loss during training were selected as the optimal parameters. The optimized parameters for the Autoencoder are presented in <xref ref-type="table" rid="table-4">Table 4</xref>.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>The optimized hyperparameters of the autoencoder</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Feature</th>
<th>Attack</th>
<th>Hidden layer activation</th>
<th>Output layer activation</th>
<th>L2 regularizer</th>
<th>Loss function</th>
<th>Optimizer</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="2">Packet-based</td>
<td>Browser hijacking</td>
<td>Sigmoid</td>
<td>Sigmoid</td>
<td>0.1</td>
<td>Mean squared error</td>
<td rowspan="4">Adam</td>
</tr>
<tr>
<td>SQL injection</td>
<td>ReLU</td>
<td>Sigmoid</td>
<td>0</td>
<td>Mean squared error</td>
</tr>
<tr>
<td rowspan="2">Flow-based</td>
<td>Browser hijacking</td>
<td rowspan="2">ReLU</td>
<td rowspan="2">ReLU</td>
<td rowspan="2">0.1</td>
<td rowspan="2">Binary cross-entropy</td>
</tr>
<tr>
<td>SQL injection</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><bold>Environment.</bold> All experiments were conducted on a PC equipped with an Intel Core i9-10980XE CPU, 128 GB RAM, and an NVIDIA GeForce RTX 3090 24 GB GPU. Furthermore, for evaluating the performance of the anomaly detection model, we utilized metrics such as Confusion Metrics, precision-recall curve, and F1 score.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Evaluation Metrics</title>
<p>The anomaly detection results of the deep learning model employed in the proposed approach can be represented using a Confusion matrix. The Confusion matrix distinguishes between four categories: True Positive (TP), False Positive (FP), False Negative (FN), and True Negative (TN), which are utilized in evaluating accuracy, precision, recall, and F1 score.</p>
<p>Accuracy refers to correctly classifying cases as anomalies or normal. Precision represents the ratio of actual anomaly data among those classified as anomalies by the model, including false positives. Recall is the proportion of actual anomaly data classified as anomalies by the model among all actual anomaly data.</p>
<p>Precision is based on the model&#x2019;s anomaly judgment data, while recall reflects the performance based on actual anomaly data. Precision and recall are in a trade-off relationship. thus, the model with the highest scores for both is considered to have the best performance.</p>
<p>The harmonic mean of these two scores is represented by the F1 score. While all metrics in <xref ref-type="disp-formula" rid="eqn-1">Eqs. (1)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-4">(4)</xref> are used in evaluating the model&#x2019;s performance in the experiments, the F1 score is predominantly used for performance comparison.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mspace width="thinmathspace" /><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo>&#x00D7;</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>OC-AD Result with Packet-Based Feature Extraction</title>
<p>This experiment conducted one-class anomaly detection using packet-based feature extraction. Additionally, the AE trained with packet-based features determined the best threshold value for detecting Browser Hijacking and SQL Injection attacks by identifying the threshold value that maximizes the F1 score.</p>
<p>In this experiment, packet-based of 7 dimensions were used, and the training of the AE was performed with 20 epochs. The architecture of the Autoencoder (AE) consists of layers with node numbers as follows, based on the dimensionality of the features mentioned in <xref ref-type="sec" rid="s4_1">Section 4.1</xref>: 7, 5, 5, 3, 5, 5, 7. Except for the code part, which constitutes 50% of the dimensions, dropout layers are configured with the same number of nodes as the input and output parts.</p>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> depicts the reconstruction error histograms for the AE trained on the Browser Hijacking test set and SQL Injection test set. In the case of the Browser Hijacking test set, <xref ref-type="fig" rid="fig-3">Fig. 3a</xref> shows a noticeable overlap in the reconstruction error value ranges between the benign class and the Browser Hijacking class. Conversely, for the SQL Injection test set, <xref ref-type="fig" rid="fig-3">Fig. 3b</xref> reveals a substantial overlap in the reconstruction error value ranges between the benign class and the SQL Injection class.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>(a) Reconstruction error histogram for browser hijacking test set (b) Reconstruction error his-togram for SQL injection test set</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-3.tif"/>
</fig>
<p>In order to perform anomaly detection for Browser Hijacking and SQL Injection attacks, it is necessary to determine the threshold for the Reconstruction Error. The threshold value was chosen to be the one that yields the highest F1 score for each attack dataset. As shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>, for the Browser Hijacking test set, the best threshold value is 0.036, resulting in a maximum F1 score of 0.820. In the case of the SQL Injection test set, the best threshold value is 0.009, with a maximum F1 score of 0.425.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>(a) Best threshold to maximum F1 score with browser hijacking test set, (b) Precision and recall value for different threshold values with browser hijacking test set, (c) Best threshold to maximum F1 score with SQL injection test set, (d) Precision and recall value for different threshold values with SQL injection test set</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-4.tif"/>
</fig>
<p>Using the Best Threshold, anomaly detection was performed on the Browser Hijacking test set and the SQL Injection test set, and accuracy, precision, recall, and F1 score were measured. <xref ref-type="table" rid="table-5">Table 5</xref> presents the anomaly detection scores for the two test sets.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Anomaly detection score with packet-based feature extraction</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Browser hijacking test set</th>
<th>SQL injection test set</th>
</tr>
</thead>
<tbody>
<tr>
<td>Best threshold</td>
<td>0.035616</td>
<td>0.009337</td>
</tr>
<tr>
<td>True positive</td>
<td>1623</td>
<td>1599</td>
</tr>
<tr>
<td>True negative</td>
<td>9185</td>
<td>5555</td>
</tr>
<tr>
<td>False positive</td>
<td>595</td>
<td>4225</td>
</tr>
<tr>
<td>False negative</td>
<td>116</td>
<td>100</td>
</tr>
<tr>
<td>Accuracy</td>
<td>0.938</td>
<td>0.623</td>
</tr>
<tr>
<td>Precision</td>
<td>0.731</td>
<td>0.274</td>
</tr>
<tr>
<td>Recall</td>
<td>0.933</td>
<td>0.941</td>
</tr>
<tr>
<td>F1 score</td>
<td>0.820</td>
<td>0.425</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The results of one-class anomaly detection using packet-based feature extraction indicate that the performance of Browser Hijacking attack detection was approximately 1.5 times better in terms of accuracy, 2.6 times better in precision, and 1.9 times better in F1 score compared to SQL Injection attack detection. However, the recall score was approximately 1.008 times better for SQL Injection attack detection.</p>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>OC-AD Result with Flow-Based Feature Extraction</title>
<p>This experiment involves one-class anomaly detection using flow-based feature extraction. Similarly to <xref ref-type="sec" rid="s4_2">Section 4.2</xref>, an AE trained with flow-based features was used to determine the best threshold value for detecting Browser Hijacking and SQL Injection attacks by identifying the threshold value that maximizes the F1 score. Flow-based features of 12 dimensions were used in this experiment, and the AE&#x2019;s training was conducted with 20 epochs.</p>
<p>The architecture of the autoencoder consists of layers with node numbers as follows, based on the dimensionality of the features mentioned in <xref ref-type="sec" rid="s4_1">Section 4.1</xref>: 12, 9, 9, 6, 9, 9, 12. Except for the code part, which constitutes 50% of the dimensions, dropout layers are configured with the same number of nodes as the input and output parts.</p>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> depicts the reconstruction error histograms for the AE trained on the Browser Hijacking test set and SQL Injection test set. In the case of the Browser Hijacking test set, <xref ref-type="fig" rid="fig-5">Fig. 5a</xref> shows some overlap in the reconstruction error value ranges between the benign class and the Browser Hijacking class. However, for the SQL Injection test set, <xref ref-type="fig" rid="fig-5">Fig. 5b</xref> demonstrates a considerable overlap in the reconstruction error value ranges between the benign class and the SQL Injection class. This pattern aligns with the results of the Reconstruction Error distribution analyzed using packet-based feature extraction in <xref ref-type="sec" rid="s4_2">Section 4.2</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>(a) Reconstruction error histogram for browser hijacking test set (b) Reconstruction error his-togram for SQL injection test set</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-5.tif"/>
</fig>
<p>To perform anomaly detection for browser hijacking and SQL injection attacks, it is essential to determine the threshold for the Reconstruction Error, following the same approach as in <xref ref-type="sec" rid="s4_2">Section 4.2</xref>. The threshold value was chosen to be the one that yields the highest F1 score for each attack dataset. As shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, for the Browser Hijacking test set, the best threshold value is 0.028, resulting in a maximum F1 score of 0.852. In the case of the SQL Injection test set, the best threshold value is 0.003, with a maximum F1 score of 0.552.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>(a) Best threshold to maximum F1 score with browser hijacking test set, (b) Precision and recall value for different threshold values with browser hijacking test set, (c) Best threshold to maximum F1 score with SQL injection test set, (d) Precision and recall value for different threshold values with SQL injection test set</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-6.tif"/>
</fig>
<p>Using the best threshold, anomaly detection based on flow features was performed on the browser hijacking test set and the SQL injection test set, and accuracy, precision, recall, and F1 score were measured. <xref ref-type="table" rid="table-6">Table 6</xref> presents the anomaly detection scores for the two test sets.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Anomaly detection score with flow-based feature extraction</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Browser hijacking test set</th>
<th>SQL injection test set</th>
</tr>
</thead>
<tbody>
<tr>
<td>Best threshold</td>
<td>0.027593</td>
<td>0.002714</td>
</tr>
<tr>
<td>True positive</td>
<td>1417</td>
<td>1534</td>
</tr>
<tr>
<td>True negative</td>
<td>9608</td>
<td>7137</td>
</tr>
<tr>
<td>False positive</td>
<td>172</td>
<td>2643</td>
</tr>
<tr>
<td>False negative</td>
<td>322</td>
<td>165</td>
</tr>
<tr>
<td>Accuracy</td>
<td>0.957</td>
<td>0.755</td>
</tr>
<tr>
<td>Precision</td>
<td>0.891</td>
<td>0.367</td>
</tr>
<tr>
<td>Recall</td>
<td>0.814</td>
<td>0.902</td>
</tr>
<tr>
<td>F1 score</td>
<td>0.851</td>
<td>0.522</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The results of one-class anomaly detection using packet-based feature extraction indicate that the performance of Browser Hijacking attack detection was approximately 1.2 times better in terms of accuracy, 2.4 times better in precision, and 1.6 times better in F1 score compared to SQL Injection attack detection. However, the recall score was approximately 1.1 times better for SQL Injection attack detection.</p>
</sec>
<sec id="s4_5">
<label>4.5</label>
<title>Comparison OC-AD Score Each Feature Extraction Method</title>
<p>In this section, we compare the results from <xref ref-type="sec" rid="s4_2">Sections 4.2</xref> and <xref ref-type="sec" rid="s4_3">4.3</xref>. For the Browser Hijacking Test set, when using flow-based feature extraction instead of packet-based feature extraction, the accuracy, precision, and F1 score all increased by approximately 1.02 to 1.21 times, while the recall decreased by approximately 1.14 times. Similarly, for the SQL Injection test set, when using flow-based feature extraction as opposed to packet-based feature extraction, accuracy, precision, and F1 score all exhibited an increase of approximately 1.21 to 1.33 times, while the recall decreased by approximately 1.04 times.</p>
<p>In <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, when comparing (a) and (c) for the browser hijacking test set&#x2019;s ROC (Receiver Operating Characteristic) curve, it&#x2019;s noticeable that the curve for (c), which employs flow-based feature extraction, is shifted more towards the upper-right corner for threshold values below 0.1 compared to (a), which uses packet-based feature extraction. Additionally, the AUC (Area Under the ROC) score increased slightly from 0.9445 to 0.9694 with flow-based feature extraction.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>(a) ROC curve using packet-based feature extraction with browser hijacking test set, (b) ROC curve using packet-based feature extraction with SQL injection test set, (c) ROC curve using flow-based feature extraction with browser hijacking test set, (d) ROC curve using flow-based feature extraction with SQL injection test set</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-7.tif"/>
</fig>
<p>Similarly, for the SQL injection test set, (b) using flow-based feature extraction shows a significant improvement in the curve compared to (d) using packet-based feature extraction. Particularly, when using packet-based feature extraction, the AUC value for SQL injection attacks was below proper classification at 0.7042, while with flow-based feature extraction, the AUC value increased to 0.7978, approximately 1.13 times better.</p>
<p>Through this, we can discern that using flow-based feature extraction results in an increase in precision compared to using packet-based feature extraction, which in turn reduces false positives. However, the decrease in recall, leading to an increase in false negatives, is relatively modest. This discrepancy, as illustrated in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, suggests that the difference in the extent of improvement is more pronounced in the case of flow-based feature extraction. Therefore, flow-based feature extraction proves to be more effective in permitting fewer missed detections while mitigating a higher number of false alarms compared to packet-based feature extraction.</p>

<p>In the Browser Hijacking attack dataset, OneClassSVM and IsolationForest performed better with packet-based feature extraction methods. However, for SQL Injection, IsolationForest demonstrated better effectiveness with packet-based feature extraction, while OneClassSVM showed more effectiveness with flow-based feature extraction.</p>
<p>In <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, both models exhibited high recall but lower precision on the attack test datasets, indicating effective attack detection but a significant number of false positives, classifying normal instances as anomalies.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Comparison OC-AD score each feature extraction method</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-8.tif"/>
</fig>
<p>Furthermore, the study compared the performance by applying the SMOTE-based method, one of the existing solutions for addressing data imbalance, to the dataset used in this research. Additionally, hyperparameter optimization was conducted for the KNN (K-Nearest Neighbor) model used as the classifier. The optimization parameters were set for n_neighbors ranging from 1 to 10.</p>
<p><xref ref-type="table" rid="table-7">Table 7</xref> presents the comprehensive (average) detection performance of the two attack datasets when the best-performing feature extraction methods for each model were applied.</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Comparison results average with other one-class models in flow-based feature extraction</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Models</th>
<th>Feature extraction method</th>
<th>Accuracy</th>
<th>Precision</th>
<th>Recall</th>
<th>F1 score</th>
</tr>
</thead>
<tbody>
<tr>
<td>IsolationForest [<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>Packet-based feature</td>
<td>0.854</td>
<td>0.533</td>
<td>0.960</td>
<td>0.682</td>
</tr>
<tr>
<td>OneClassSVM [<xref ref-type="bibr" rid="ref-36">36</xref>]</td>
<td>Flow-based feature</td>
<td>0.739</td>
<td>0.363</td>
<td><bold>0.969</bold></td>
<td>0.527</td>
</tr>
<tr>
<td><bold>Our propose methods</bold></td>
<td>Flow-based feature</td>
<td><bold>0.856</bold></td>
<td><bold>0.629</bold></td>
<td>0.858</td>
<td><bold>0.686</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The proposed model showed the highest values for Accuracy, Precision, and F1 score. However, the Recall value was highest for OneClassSVM. The F1 score of the Isolation model showed a similar value to the proposed model. However, there was a larger difference between the Recall and Precision values, indicating a higher false positive rate compared to the proposed model.</p>
</sec>
<sec id="s4_6">
<label>4.6</label>
<title>Comparison OC-AD Score Each Feature Extraction Method</title>
<p>To address data imbalance, numerous data augmentation methods have been proposed historically. To compare the performance of our proposed model, we implemented the packetCGAN model suggested in [<xref ref-type="bibr" rid="ref-25">25</xref>] and the Fest-SMOTE model presented in [<xref ref-type="bibr" rid="ref-28">28</xref>]. Both models were used to augment attack data.</p>
<p>The packetCGAN model utilized an MLP (Multi-Layer Perceptron) classifier, while Fest-SMOTE employed a KNN classifier to classify malicious traffic. The MLP classifier used the layer structure and hyperparameters specified in [<xref ref-type="bibr" rid="ref-25">25</xref>], with a threshold set at 0.5. The KNN classifier&#x2019;s optimal hyperparameter &#x2018;k&#x2019; was determined using GridSearchCV with 5-fold cross-validation before performance evaluation.</p>
<p>The datasets used for performance evaluation included both the browser hijacking attack set and the SQL injection attack set. Additionally, evaluations were conducted separately for packet-based feature sets and flow-based feature sets for each attack, resulting in a total of four evaluation scenarios.</p>
<p>As shown in <xref ref-type="table" rid="table-8">Table 8</xref>, the data used for testing each model was consistently set. To simulate real attack scenarios using CICIoT data, augmented data was employed for both training and validation datasets.</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Train, validation, test data set information used for performance comparison</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Models</th>
<th>Augmented data</th>
<th>Train set info</th>
<th>Validation set info</th>
<th>Test set info</th>
</tr>
</thead>
<tbody>
<tr>
<td>PacketCGAN [<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td>29340</td>
<td>Normal: 19560<break/>Attack: 19560<break/>(Augmented data)</td>
<td>Normal: 9780<break/>Attack: 9780<break/>(Augmented data)</td>
<td>Normal: 9779<break/>Attack: 1739 (1699)<break/>(CICIoT data)</td>
</tr>
<tr>
<td>Fest-SMOTE [<xref ref-type="bibr" rid="ref-28">28</xref>]</td>
<td>29340</td>
<td>Normal: 19560<break/>Attack: 19560<break/>(Augmented data)</td>
<td>Normal: 9780<break/>Attack: 9780<break/>(Augmented data)</td>
<td>Normal: 9779<break/>Attack: 1739 (1699)<break/>(CICIoT data)</td>
</tr>
<tr>
<td><bold>Proposed method</bold></td>
<td>&#x2013;</td>
<td>Normal: 19560<break/>Attack: 0</td>
<td>Normal: 9780<break/>Attack: 0</td>
<td>Normal: 9779<break/>Attack: 1739 (1699)<break/>(CICIoT data)</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Performance evaluation was conducted by calculating the average detection performance across both attacks using a single feature set, to determine how effectively each model detected the two types of attacks.</p>
<p><xref ref-type="table" rid="table-9">Table 9</xref> shows the detection performance for browser hijacking and SQL injection attack traffic using packet-based features.</p>
<table-wrap id="table-9">
<label>Table 9</label>
<caption>
<title>Comparison results average with oversampling models in packet-based feature extraction</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Metrics/Models</th>
<th>PacketCGAN [<xref ref-type="bibr" rid="ref-25">25</xref>]</th>
<th>Fest-SMOTE [<xref ref-type="bibr" rid="ref-28">28</xref>]</th>
<th>Proposed method</th>
</tr>
</thead>
<tbody>
<tr>
<td>Accuracy</td>
<td>0.8505</td>
<td><bold>0.8599</bold></td>
<td>0.781</td>
</tr>
<tr>
<td>Precision</td>
<td>0</td>
<td><bold>0.7900</bold></td>
<td>0.503</td>
</tr>
<tr>
<td>Recall</td>
<td>0</td>
<td>0.0778</td>
<td><bold>0.937</bold></td>
</tr>
<tr>
<td>F1 score</td>
<td>0</td>
<td>0.1410</td>
<td><bold>0.623</bold></td>
</tr>
<tr>
<td>AUC</td>
<td>0.7074</td>
<td>0.5376</td>
<td><bold>0.824</bold></td>
</tr>
<tr>
<td>TN</td>
<td>9779</td>
<td>9752.5</td>
<td>7370</td>
</tr>
<tr>
<td>FP</td>
<td>0</td>
<td>26.5</td>
<td>2410</td>
</tr>
<tr>
<td>FN</td>
<td>1719</td>
<td>1584.5</td>
<td>108</td>
</tr>
<tr>
<td>TP</td>
<td>0</td>
<td>134.5</td>
<td>1611</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>For packetCGAN, all classifications were predicted as normal, resulting in TP and FP values of 0, and thus precision, recall, and F1 score values of 0. However, the AUC value was 0.7074, indicating that the issue might be related to the threshold used by the MLP classifier. This AUC value was the second highest among the three models.</p>
<p>For Fest-SMOTE, the accuracy and precision values were higher than those of the other models. However, the recall value was very low at 0.0778, indicating poor performance in detecting attacks. Additionally, the AUC value was 0.5376, the lowest among the compared models.</p>
<p>The proposed model had higher recall and F1 score values compared to the other models. Since a higher recall value indicates better attack detection performance, the proposed model showed the best attack detection performance among the compared models. Furthermore, the AUC value, which considers the threshold, was 0.824, the highest among the compared models.</p>
<p>The detection performance for browser hijacking and SQL injection attack traffic using flow-based features is shown in <xref ref-type="table" rid="table-10">Table 10</xref>.</p>
<table-wrap id="table-10">
<label>Table 10</label>
<caption>
<title>Comparison results average with oversampling models in flow-based feature extraction</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Metrics/Models</th>
<th>PacketCGAN [<xref ref-type="bibr" rid="ref-25">25</xref>]</th>
<th>Fest-SMOTE [<xref ref-type="bibr" rid="ref-28">28</xref>]</th>
<th>Proposed method</th>
</tr>
</thead>
<tbody>
<tr>
<td>Accuracy</td>
<td>0.8505</td>
<td><bold>0.8873</bold></td>
<td>0.856</td>
</tr>
<tr>
<td>Precision</td>
<td>0</td>
<td><bold>0.9674</bold></td>
<td>0.629</td>
</tr>
<tr>
<td>Recall</td>
<td>0</td>
<td>0.2468</td>
<td><bold>0.858</bold></td>
</tr>
<tr>
<td>F1 score</td>
<td>0</td>
<td>0.3619</td>
<td><bold>0.6865</bold></td>
</tr>
<tr>
<td>AUC</td>
<td>0.2092</td>
<td>0.6267</td>
<td><bold>0.8836</bold></td>
</tr>
<tr>
<td>TN</td>
<td>9779</td>
<td>9775</td>
<td>8372.5</td>
</tr>
<tr>
<td>FP</td>
<td>0</td>
<td>4</td>
<td>1407.5</td>
</tr>
<tr>
<td>FN</td>
<td>1719</td>
<td>5791</td>
<td>243.5</td>
</tr>
<tr>
<td>TP</td>
<td>0</td>
<td>428</td>
<td>1534</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>For packetCGAN, similar to the previous case, all classifications were predicted as normal, resulting in TP and FP values of 0, and thus precision, recall, and F1 score values of 0. Additionally, the AUC value was 0.2092, which is lower than when using packet-based features, indicating decreased performance. This was the lowest performance among the compared models.</p>
<p>For Fest-SMOTE, the accuracy and precision values were higher than those of the other models. The recall value improved to 0.2468 compared to when using packet-based features, but it still showed insufficient performance in detecting attacks. The AUC value was 0.6267, which was the second highest performance among the compared models.</p>
<p>For the proposed model, the recall and F1 score values were higher than those of the other models. The recall value decreased to 0.858 compared to when using packet-based features, but it still showed the best attack detection performance among the compared models. Additionally, the AUC value was 0.8836, which was the highest performance among the compared models.</p>
<p><xref ref-type="fig" rid="fig-9">Fig. 9</xref> presents a chart comparing the performance results derived above at a glance. The performance metrics of the three models are listed for each feature used. The same model is indicated using similar color shades.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>AD score comparison with oversampling approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_51221-fig-9.tif"/>
</fig>
<p>For accuracy and precision, the combination of the Fest-SMOTE-based KNN classifier with flow-based features showed the highest performance, with an accuracy of 0.8873, which is 5.69% higher than the average of 0.8395 for other cases.</p>
<p>In terms of recall, the proposed model using packet-based features achieved the highest performance with a recall of 0.9370. This indicates that it detects the tested attacks most effectively.</p>
<p>For the F1 score, the proposed model using flow-based features showed the highest performance with a score of 0.6865. The F1 score, being the harmonic mean of precision and recall, is a good metric to use when dealing with imbalanced data. This indicates that the proposed model with flow-based features effectively distinguishes between normal and malicious traffic, detecting attacks harmoniously.</p>
<p>The performance metrics can vary depending on the threshold used for detecting attacks. Therefore, we also compared the performance using the AUC value, which considers various thresholds. The proposed model using flow-based features had an AUC value of 0.8836, which is 52.06% higher than the average AUC value of 0.5811 for the other models.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>We proposed an autoencoder-based method for anomaly detection using a small amount of packet metadata and training only on normal data to detect anomalies based on reconstruction error values. In this method, we excluded simple packet metadata that could bias model training from being used as training features in the data feature extraction process.</p>
<p>With the selected small amount of packet metadata, we applied packet-based and flow-based feature extraction methods to the CICIoT2023 dataset and compared their performance with the proposed autoencoder-based anomaly detection model. The dataset was created using various IoT devices commonly found in smart homes, including 105 cameras, plugs, lighting systems, home automation devices, and more.</p>
<p>The proposed method is expected to be applicable in environments where diverse IoT devices are interconnected, offering versatility across different IoT setups. Furthermore, the proposed method utilizes metadata from the Frame and TCP layers. Additionally, metadata related to TLS only utilizes the payload length of encrypted traffic. Therefore, the proposed method is applicable to all encryption protocols that ensure TLS-based connectivity, indicating scalability across various protocols.</p>
<p>Through two experimental results, we verified which feature type is more effective for autoencoder-based one-class anomaly detection and compared the performance with the previously proposed oversampling approaches.</p>
<p>In the feature type experiment, the flow-based extraction method showed significant improvement over the packet-based extraction method. Specifically, for the browser hijacking malicious data, the F1 score increased from 0.802 to 0.851, a 6.23% improvement, and for the SQL injection malicious data, it increased from 0.425 to 0.522, a 22.82% improvement.</p>
<p>When comparing performance differences by attack type, there was no significant difference between the two feature extraction methods for browser hijacking. However, a substantial difference was observed for SQL injection. This suggests that the importance or necessity of features can vary depending on the attack type and model.</p>
<p>In the comparison experiment with the previously proposed oversampling approaches, the proposed model demonstrated the best performance in terms of recall, focusing on detecting attacks, with a recall value of 0.9370.</p>
<p>Additionally, the F1 score, which evaluates the harmonious distinction between normal and attack traffic, showed the best performance with a score of 0.6865.</p>
<p>Notably, when comparing performance using the AUC value, which considers the classifier&#x2019;s threshold, the proposed model showed superior performance. For packet-based features, it achieved an AUC value of 0.8244, which is 32.43% higher than the average of 0.6225 for other models. For flow-based features, it achieved an AUC value of 0.8836, which is 111.39% higher than the average of 0.418 for other models.</p>
<p>However, this paper has the following limitations: (1) Performance was evaluated for only one type of attack, and (2) The number of SSL/TLS traffic data in the attack samples was limited. (3) The normal data used for training was sampled from only one dataset, and (4) The handling of outliers that may be present within normal data and the optimal selection of the number of nodes for each model layer were not considered. Future research will explore anomaly detection using session-based feature extraction methods. This will involve comparing the performance of existing payload-based methods with the method proposed in this study. Furthermore, there are plans to research attack multi-classification using reconstruction errors.</p>
</sec>
</body>
<back>
<ack>
<p>This work was supported by Institute of Information &#x0026; Communications Technology Planning &#x0026; Evaluation (IITP) grant funded by the Korea government (MSIT).</p>
</ack>
<sec><title>Funding Statement</title>
<p>This work was supported by Institute of Information &#x0026; Communications Technology Planning &#x0026; Evaluation (IITP) grant funded by the Korea government (MSIT) (No. RS-2023-00235509, Development of Security Monitoring Technology Based Network Behavior against Encrypted Cyber Threats in ICT Convergence Environment).</p>
</sec>
<sec><title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Min-Gyu Kim, Hwankuk Kim; data collection: Min-Gyu Kim; analysis and interpretation of results: Min-Gyu Kim, Hwankuk Kim; draft manuscript preparation: Min-Gyu Kim. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The datasets generated during and/or analyzed during the current study are available in the Canadian institute for cybersecurity (CIC) repository, <ext-link ext-link-type="uri" xlink:href="https://www.unb.ca/cic/datasets/iotdataset-2023.html">https://www.unb.ca/cic/datasets/iotdataset-2023.html</ext-link> (accessed on 8 January 2024).</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hasan</surname> <given-names>MK</given-names></string-name>, <string-name><surname>Jahan</surname> <given-names>N</given-names></string-name>, <string-name><surname>Nazri</surname> <given-names>MZA</given-names></string-name>, <string-name><surname>Islam</surname> <given-names>S</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Alzahrani</surname> <given-names>AI</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Federated learning for computational offloading and resource management of vehicular edge computing in 6G-V2X network</article-title>. <source>IEEE Trans Consum Electron</source>. <year>2024</year> <month>Feb</month>;<volume>70</volume>(<issue>1</issue>):<fpage>3827</fpage>&#x2013;<lpage>47</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TCE.2024.3357530</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Behera</surname> <given-names>TK</given-names></string-name>, <string-name><surname>Bakshi</surname> <given-names>S</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Albarakati</surname> <given-names>HM</given-names></string-name></person-group>. <article-title>A lightweight multiscale-multiobject deep segmentation architecture for UAV-based consumer applications</article-title>. <source>IEEE Trans Consum Electron</source>. <year>2024</year>;<volume>70</volume>(<issue>1</issue>):<fpage>3740</fpage>&#x2013;<lpage>53</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TCE.2024.3367531</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Oltrogge</surname> <given-names>M</given-names></string-name>, <string-name><surname>Huaman</surname> <given-names>N</given-names></string-name>, <string-name><surname>Amft</surname> <given-names>S</given-names></string-name>, <string-name><surname>Acar</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Backes</surname> <given-names>M</given-names></string-name>, <string-name><surname>Fahl</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Why eve and mallory still love android: revisiting TLS (In)security in android applications</article-title>. In: <conf-name>30th USENIX Security Symposium (USENIX Security 21)</conf-name>; <year>2021</year> <month>Aug</month> <day>11&#x2013;13</day>. p. <fpage>4347</fpage>&#x2013;<lpage>64</lpage>.</mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Orikogbo</surname> <given-names>D</given-names></string-name>, <string-name><surname>B&#x00FC;CRiOS</surname> <given-names>M</given-names></string-name>, <string-name><surname>Egele</surname> <given-names>M</given-names></string-name></person-group>. <article-title>CRiOS: toward large-scale iOS application analysis</article-title>. In: <conf-name>Proceedings of the 6th Workshop on Security and Privacy in Smartphones and Mobile Devices</conf-name>: <year>2016</year> <month>Oct</month> <day>24</day>; <publisher-loc>Vienna, Austria</publisher-loc>. p. <fpage>33</fpage>&#x2013;<lpage>42</lpage>. doi:<pub-id pub-id-type="doi">10.1145/2994459.2994473</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Felt</surname> <given-names>AP</given-names></string-name>, <string-name><surname>Barnes</surname> <given-names>R</given-names></string-name>, <string-name><surname>King</surname> <given-names>A</given-names></string-name>, <string-name><surname>Palmer</surname> <given-names>C</given-names></string-name>, <string-name><surname>Bentzel</surname> <given-names>C</given-names></string-name>, <string-name><surname>Tabriz</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Measuring {HTTPS} adoption on the web</article-title>. In: <conf-name>26th USENIX Security Symposium (USENIX Security 17)</conf-name>; <year>2017</year> <month>Aug</month> <day>16&#x2013;18</day>; <publisher-loc>Vancouver, BC, Canada</publisher-loc>: <publisher-name>Sheraton Vancouver Wall Centre</publisher-name>. p. <fpage>1323</fpage>&#x2013;<lpage>38</lpage>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Alrawi</surname> <given-names>O</given-names></string-name>, <string-name><surname>Lever</surname> <given-names>C</given-names></string-name>, <string-name><surname>Antonakakis</surname> <given-names>M</given-names></string-name>, <string-name><surname>Monrose</surname> <given-names>F</given-names></string-name></person-group>. <article-title>SoK: security evaluation of home-based IoT deployments</article-title>. In: <conf-name>2019 IEEE Symposium on Security and Privacy (SP)</conf-name>; <year>2019</year>; <publisher-loc>San Francisco, CA, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>1362</fpage>&#x2013;<lpage>80</lpage>. doi:<pub-id pub-id-type="doi">10.1109/SP.2019.00013</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tariq</surname> <given-names>U</given-names></string-name>, <string-name><surname>Ahmed</surname> <given-names>I</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Bashir</surname> <given-names>AK</given-names></string-name></person-group>. <article-title>Fortifying IoT against crimpling cyber-attacks: a systematic review</article-title>. <source>Karbala Int J Mod Sci</source>. <year>2023</year>;<volume>9</volume>(<issue>4</issue>):<fpage>665</fpage>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Naqvi</surname> <given-names>SMA</given-names></string-name>, <string-name><surname>Shabaz</surname> <given-names>M</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Hassan</surname> <given-names>SI</given-names></string-name></person-group>. <article-title>Adversarial attacks on visual objects using the fast gradient sign method</article-title>. <source>J Grid Comput</source>. <year>2023</year>;<volume>21</volume>(<issue>4</issue>):<fpage>1</fpage>&#x2013;<lpage>20</lpage>.</mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>&#x00D6;zdel</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ate&#x015F;</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ate&#x015F;</surname> <given-names>PD</given-names></string-name>, <string-name><surname>Koca</surname> <given-names>M</given-names></string-name>, <string-name><surname>Anarım</surname> <given-names>SME</given-names></string-name></person-group>. <article-title>Payload-based network traffic analysis for application classification and intrusion detection</article-title>. In: <conf-name>2022 30th European Signal Processing Conference (EUSIPCO)</conf-name>; <year>2022</year>; <publisher-loc>Belgrade, Serbia</publisher-loc>. p. <fpage>638</fpage>&#x2013;<lpage>42</lpage>. doi:<pub-id pub-id-type="doi">10.23919/EUSIPCO55093.2022.9909683</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Yuan</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Encrypted traffic classification model based on SwinT-CNN</article-title>. In: <conf-name>2023 4th International Conference on Computer Engineering and Application (ICCEA)</conf-name>; <year>2023</year>; <publisher-loc>Hangzhou, China</publisher-loc>. p. <fpage>138</fpage>&#x2013;<lpage>42</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICCEA58433.2023.10135305</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Okonkwo</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Foo</surname> <given-names>E</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Hou</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>A CNN based encrypted network traffic classifier</article-title>. In: <conf-name>Proceedings of the 2022 Australasian Computer Science Week</conf-name>; <year>2022</year>; <publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>Association for Computing Machinery</publisher-name>. p. <fpage>47</fpage>&#x2013;<lpage>83</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3511616.3513101</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>L</given-names></string-name>, <string-name><surname>Xiao</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wei</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Sliding window based feature extraction and traffic clustering for green mobile cyberphysical systems</article-title>. <source>Mob Inf Syst</source>. <year>2017</year>;<volume>2017</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>10</lpage>. doi:<pub-id pub-id-type="doi">10.1155/2017/2409830</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yan</surname> <given-names>H</given-names></string-name>, <string-name><surname>He</surname> <given-names>L</given-names></string-name>, <string-name><surname>Song</surname> <given-names>X</given-names></string-name>, <string-name><surname>Yao</surname> <given-names>W</given-names></string-name>, <string-name><surname>Li</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Bidirectional statistical feature extraction based on time window for tor flow classification</article-title>. <source>Symmetry</source>. <year>2022</year>;<volume>14</volume>(<issue>10</issue>):<fpage>2002</fpage>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dahiya</surname> <given-names>D</given-names></string-name></person-group>. <article-title>DDoS attacks detection in 5G networks: hybrid model with statistical and higher-order statistical features</article-title>. <source>Cybern Syst</source>. <year>2023</year>;<volume>54</volume>(<issue>6</issue>):<fpage>888</fpage>&#x2013;<lpage>913</lpage>. doi:<pub-id pub-id-type="doi">10.1080/01969722.2022.2122002</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yan</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Rui</surname> <given-names>L</given-names></string-name>, <string-name><surname>Lyu</surname> <given-names>R</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>B</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>A network traffic classification method based on dual-mode feature extraction and hybrid neural networks</article-title>. <source>IEEE Trans Netw Serv Manage</source>. <year>2023</year>;<volume>20</volume>(<issue>4</issue>):<fpage>4073</fpage>&#x2013;<lpage>84</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TNSM.2023.3262246</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Arshad</surname> <given-names>QUA</given-names></string-name>, <string-name><surname>Raza</surname> <given-names>M</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>WZ</given-names></string-name>, <string-name><surname>Siddiqa</surname> <given-names>A</given-names></string-name>, <string-name><surname>Muiz</surname> <given-names>A</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MA</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Anomalous situations recognition in surveillance images using deep learning</article-title>. <source>Comput Mater Contin</source>. <year>2023</year>;<volume>76</volume>(<issue>1</issue>):<fpage>1103</fpage>&#x2013;<lpage>25</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2023.039752</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fatani</surname> <given-names>A</given-names></string-name>, <string-name><surname>Dahou</surname> <given-names>A</given-names></string-name>, <string-name><surname>Al-qaness</surname> <given-names>MAA</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Abd Elaziz</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Advanced feature extraction and selection approach using deep learning and aquila optimizer for IoT intrusion detection system</article-title>. <source>Sensors</source>. <year>2022</year>;<volume>22</volume>(<issue>1</issue>):<fpage>140</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s22010140</pub-id>; <pub-id pub-id-type="pmid">35009682</pub-id></mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yao</surname> <given-names>R</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Unsupervised anomaly detection using variational autoencoder based feature extraction</article-title>. In: <conf-name>2019 IEEE International Conference on Prognostics and Health Management (ICPHM)</conf-name>; <year>2019</year> <month>Jun</month> <day>17&#x2013;20</day>; <publisher-loc>San Francisco, CA, USA</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICPHM.2019.8819434</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ruikun</surname> <given-names>L</given-names></string-name>, <string-name><surname>Yun</surname> <given-names>L</given-names></string-name>, <string-name><surname>He</surname> <given-names>W</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>LR</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>JC</given-names></string-name></person-group>. <article-title>Multi-layer reconstruction errors autoencoding and density estimate for network anomaly detection</article-title>. <source>Comput Model Eng Sci</source>. <year>2021</year>;<volume>128</volume>(<issue>1</issue>):<fpage>381</fpage>&#x2013;<lpage>98</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2021.016264</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Jang-Jaccard</surname> <given-names>J</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>A</given-names></string-name>, <string-name><surname>Wei</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Sabrina</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Improving performance of autoencoder based network anomaly detection on NSL-KDD dataset</article-title>. <source>IEEE Access</source>. <year>2021</year>;<volume>9</volume>:<fpage>140136</fpage>&#x2013;<lpage>46</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2021.3116612</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yilmaz</surname> <given-names>I</given-names></string-name>, <string-name><surname>Masum</surname> <given-names>R</given-names></string-name>, <string-name><surname>Siraj</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Addressing imbalanced data problem with generative adversarial network for intrusion detection</article-title>. In: <conf-name>2020 IEEE 21st International Conference on Information Reuse and Integration for Data Science (IRI)</conf-name>; <year>2020</year>; <publisher-loc>Las Vegas, NV, USA</publisher-loc>. p. <fpage>25</fpage>&#x2013;<lpage>30</lpage>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jamoos</surname> <given-names>M</given-names></string-name>, <string-name><surname>Mora</surname> <given-names>AM</given-names></string-name>, <string-name><surname>AlKhanafseh</surname> <given-names>M</given-names></string-name>, <string-name><surname>Surakhi</surname> <given-names>O</given-names></string-name></person-group>. <article-title>A new data-balancing approach based on generative adversarial network for network intrusion detection system</article-title>. <source>Electronics</source>. <year>2023</year>;<volume>12</volume>(<issue>13</issue>):<fpage>2851</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics12132851</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>23.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yuan</surname> <given-names>L</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Duan</surname> <given-names>M</given-names></string-name>, <string-name><surname>Li</surname> <given-names>K</given-names></string-name></person-group>. <article-title>A data balancing approach based on generative adversarial network</article-title>. <source>Future Gener Comput Syst</source>. <year>2023</year>;<volume>141</volume>:<fpage>768</fpage>&#x2013;<lpage>76</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.future.2022.12.024</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rao</surname> <given-names>YN</given-names></string-name>, <string-name><surname>Suresh Babu</surname> <given-names>K</given-names></string-name></person-group>. <article-title>An imbalanced generative adversarial network-based approach for network intrusion detection in an imbalanced dataset</article-title>. <source>Sensors</source>. <year>2023</year>;<volume>23</volume>(<issue>1</issue>):<fpage>550</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s23010550</pub-id>; <pub-id pub-id-type="pmid">36617148</pub-id></mixed-citation></ref>
<ref id="ref-25"><label>25.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>P</given-names></string-name>, <string-name><surname>Li</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ye</surname> <given-names>F</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>M</given-names></string-name></person-group>. <article-title>PacketCGAN: exploratory study of class imbalance for encrypted traffic classification using CGAN</article-title>. In: <conf-name>ICC 2020 &#x2013; 2020 IEEE International Conference on Communications (ICC)</conf-name>; <year>2020</year> <month>Jun</month> <day>07&#x2013;11</day>; <publisher-loc>Dublin, Ireland</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICC40277.2020.9148946</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>26.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Hassanat</surname> <given-names>AB</given-names></string-name>, <string-name><surname>Tarawneh</surname> <given-names>AS</given-names></string-name>, <string-name><surname>Altarawneh</surname> <given-names>GA</given-names></string-name>, <string-name><surname>Almuhaimeed</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Stop oversampling for class imbalance learning: a critical review</article-title>; <year>2022</year>. doi:<pub-id pub-id-type="doi">10.48550/arXiv.2202.03579</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>27.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Mondal</surname> <given-names>AK</given-names></string-name>, <string-name><surname>Singhal</surname> <given-names>L</given-names></string-name>, <string-name><surname>Tiwary</surname> <given-names>P</given-names></string-name>, <string-name><surname>Singla</surname> <given-names>P</given-names></string-name>, <string-name><surname>AP</surname> <given-names>P</given-names></string-name></person-group>. <chapter-title>Minority oversampling for imbalanced data via class-preserving regularized auto-encoders</chapter-title>. In: <conf-name>Proceedings of the 26th International Conference on Artificial Intelligence and Statistics</conf-name>. <publisher-name>PMLR</publisher-name>; <year>2023</year>. vol. <volume>206</volume></mixed-citation></ref>
<ref id="ref-28"><label>28.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rodr&#x00ED;guez-Torres</surname> <given-names>F</given-names></string-name>, <string-name><surname>Mart&#x00ED;nez-Trinidad</surname> <given-names>JF</given-names></string-name>, <string-name><surname>Carrasco-Ochoa</surname> <given-names>JA</given-names></string-name></person-group>. <article-title>An oversampling method for class imbalance problems on large datasets</article-title>. <source>Appl Sci</source>. <year>2022</year>;<volume>12</volume>(<issue>7</issue>):<fpage>3424</fpage>. doi:<pub-id pub-id-type="doi">10.3390/app12073424</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>29.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Saripuddin</surname> <given-names>M</given-names></string-name>, <string-name><surname>Suliman</surname> <given-names>A</given-names></string-name>, <string-name><surname>Syarmila Sameon</surname> <given-names>S</given-names></string-name>, <string-name><surname>Jorgensen</surname> <given-names>BN</given-names></string-name></person-group>. <article-title>Random undersampling on imbalance time series data for anomaly detection</article-title>. In: <conf-name>Proceedings of the 2021 4th International Conference on Machine Learning and Machine Intelligence</conf-name>; <year>2022</year>; <publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>Association for Computing Machinery</publisher-name>. doi:<pub-id pub-id-type="doi">10.1145/3490725.349074</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>30.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bach</surname> <given-names>M</given-names></string-name>, <string-name><surname>Werner</surname> <given-names>A</given-names></string-name>, <string-name><surname>Palt</surname> <given-names>M</given-names></string-name></person-group>. <article-title>The proposal of undersampling method for learning from imbalanced datasets</article-title>. <source>Procedia Comput Sci</source>. <year>2019</year>;<volume>159</volume>:<fpage>125</fpage>&#x2013;<lpage>34</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.procs.2019.09.167</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>31.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>C</given-names></string-name>, <string-name><surname>He</surname> <given-names>X</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>K</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>R</given-names></string-name></person-group>. <article-title>The impact of partial balance of imbalanced dataset on classification performance</article-title>. <source>Electronics</source>. <year>2022</year>;<volume>11</volume>(<issue>9</issue>):<fpage>1322</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics11091322</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>32.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Vaiyapuri</surname> <given-names>T</given-names></string-name>, <string-name><surname>Binbusayyis</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Application of deep autoencoder as an one-class classifier for unsupervised network intrusion detection: a comparative evaluation</article-title>. <source>PeerJ Comput Sci</source>. <year>2020</year>;<volume>6</volume>:<fpage>e327</fpage>. doi:<pub-id pub-id-type="doi">10.7717/peerj-cs.327</pub-id>; <pub-id pub-id-type="pmid">33816977</pub-id></mixed-citation></ref>
<ref id="ref-33"><label>33.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Krawczyk</surname> <given-names>B</given-names></string-name>, <string-name><surname>Galar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wo&#x00C5;&#x017E;niak</surname> <given-names>M</given-names></string-name>, <string-name><surname>Bustince</surname> <given-names>H</given-names></string-name>, <string-name><surname>Herrera</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Dynamic ensemble selection for multi-class classification with one-class classifiers</article-title>. <source>Pattern Recognit</source>. <year>2018</year>;<volume>83</volume>:<fpage>34</fpage>&#x2013;<lpage>51</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.patcog.2018.05.015</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>34.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Klikowski</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wozniak</surname> <given-names>M</given-names></string-name></person-group>. <chapter-title>Employing one-class SVM classifier ensemble for imbalanced data stream classification</chapter-title>. In: <source>Lecture notes in computer science</source>. <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>; <year>2020</year>. vol. <volume>12140</volume>. p. <fpage>117</fpage>&#x2013;<lpage>27</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-3-030-50423-6_9</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>35.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>FT</given-names></string-name>, <string-name><surname>Ting</surname> <given-names>KM</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>ZH</given-names></string-name></person-group>. <article-title>Isolation forest</article-title>. In: <conf-name>2008 Eighth IEEE International Conference on Data Mining</conf-name>; <year>2008</year>; <publisher-loc>Pisa, Italy</publisher-loc>. p. <fpage>413</fpage>&#x2013;<lpage>22</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICDM.2008.17</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>36.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Sch&#x00F6;lkopf</surname> <given-names>B</given-names></string-name>, <string-name><surname>Williamson</surname> <given-names>RC</given-names></string-name>, <string-name><surname>Smola</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shawe-Taylor</surname> <given-names>J</given-names></string-name>, <string-name><surname>Platt</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Support vector method for novelty detection</article-title>. In: <conf-name>Proceedings of the 12th International Conference on Neural Information Processing Systems (NIPS&#x2019;99)</conf-name>; <year>1999</year>; <publisher-loc>Cambridge, MA, USA</publisher-loc>. p. <fpage>582</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.5555/3009657.3009740</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>