# Multistage System-Based Machine Learning Techniques for Intrusion Detection in WiFi Network

Authors: Vu Viet Thang; F. F. Pashchenko
Journal: Journal of Computer Networks and Communications
 (2019)

---

## Abstract

The aim of machine learning is to develop algorithms that can learn from data and solve specific problems in some context as human do. This paper presents some machine learning models applied to the intrusion detection system in WiFi network. Firstly, we present an incremental semisupervised clustering based on a graph. Incremental clustering or one-pass clustering is very useful when we work with data stream or dynamic data. In fact, for traditional clustering such as K-means, Fuzzy C-Means, DBSCAN, etc., many versions of incremental clustering have been developed. However, to the best of our knowledge, there is no incremental semisupervised clustering in the literature. Secondly, by combining a K-means algorithm and a measure of local density score, we propose a fast outlier detection algorithm, named FLDS. The complexity of FLDS isOn1.5 while the results obtained are comparable with the algorithm LOF. Thirdly, we introduce a multistage system-based machine learning techniques for mining the intrusion detection data applied for the 802.11 WiFi network. Finally, experiments conducted on some data sets extracted from the 802.11 networks and UCI data sets show the effectiveness of our new proposed methods.


---

## Body

## 1. Introduction

Machine learning is a central problem in artificial intelligence. The purpose of machine learning is concerned with the development of algorithms and techniques that allow computers tolearn. There are some principal kinds of machine learning such as supervised learning, unsupervised learning, and semisupervised learning. The application of machine learning techniques is very varied, for example, fault detection in bank data, transaction data, and intrusion detection system in networking, bioinformatics, natural language processing, image analysis, etc. [1]. Additionally, machine learning is very useful in cases in which human expertise does exist (robot in the Mars, in the sea, etc.), solution change in time (networking, surveillance), or solution needs to be adapted to particular cases. This paper focuses on developing machine learning techniques for intrusion detection systems in WiFi network.Intrusion detection system (IDS) is one of the most emerging tasks in the network connectivity. Each year, there are lots of network attacks in the world; consequently, the cost for solving these problems is very big, and was reported to be about 500 billion USD in 2017. This problem is a challenge not only for government/organizations but also for individuals in daily lives. To protect the computer network system, in general, some methods can be used such as firewalls, data encryption, or user authentication. The firmware is one technique to protect the system, but nowadays, the external mechanisms have emerged and quickly become popular. One important method for data mining in intrusion detection problem proposed in the literature is to use machine learning techniques [2–8]. The IDS has monitored directly the network transactions where each transaction is either normal or malicious. The aim of IDS is to detect and alert network administrators when it detects a transaction that is an attack. In some case, the IDS can even immediately block the connection.Generally, data mining task in IDS must detect two kinds of attack including known attacks and outlier (anomaly) attacks. For the known attacks, we can use a (semi-)supervised learning method such as neural network, support vector machine, random forest, decision tree, and naïve Bayes, to mention a few, to construct a classifier from data training (labeled normal/attacks connection) [4–7, 9]. The classifier trained is used for detecting new connections, and the supervised learning model is illustrated in Figure 1. With the outlier attacks in which we do not know its labels, the trained classifier cannot detect them. In this case, we have to use another kind of machine learning called unsupervised outliers detection such as LOF [10], ODIN [11], and so on. The outliers detection process can be realized offline for some periods of time defined by users/experts. The general schema for outlier detection is presented in Figure 2, and this is the unsupervised learning model. The aim of this schema is to detect outliers in a period of time. For example of IDS systems, the users can set a period of time from u to v for capturing the data, then the data will be transformed by the preprocessing step, and finally, we can use an outlier detection method to detect attacks from the observed data.Figure 1
A general model for misuse detection in IDS.Figure 2
A general model for outlier detection in IDS.The contributions of our paper are as follows:(i)
We propose an incremental semisupervised graph-based clustering. To the best of our knowledge, this is the first incremental semisupervised clustering algorithm. The preliminary work is presented in [12].(ii)
We introduce a fast outliers detection method based on local density score and K-means clustering algorithm. The preliminary work is introduced in [13].(iii)
We propose a multistage system-based machine learning techniques which can boost the accuracy of the intrusion detection process for the 802.11 WiFi data set.(iv)
The experiments carefully conducted on data set extracted from Aegean WiFi Intrusion Dataset (AWID) show the effectiveness of our proposed algorithms [14]. The AWID is a publicly available collection of sets of data which contain real traces of both the normal and intrusive 802.11 traffic. Up to date, AWID is one of the standard data sets to evaluate the capacity of IDS systems.This paper is organized as follows. Section2 presents the related work. Section 3 introduces the new incremental semisupervised clustering method and a new fast outlier detection algorithm. Section 4 presents experiments for the proposed algorithms and proposes a hybrid framework applied for the AWID data set. Finally, Section 5 concludes the paper and presents some direction for further research studies.


## 2. Incremental Clustering and Outlier Detection

### 2.1. Incremental Clustering

Clustering is the task of partitioning a data set intok clusters in which the points in the same cluster are similar and the points in different clusters are dissimilar. The context of incremental clustering is as follows: given some current clusters, the incremental clustering is one-pass clustering kind which aims to identify cluster label for incremental data points. Incremental clustering is very useful for data stream or dynamic data (data warehouse). In general, the incremental clustering is combined with two processes of insertion and deletion. Given a set of clusters, the insertion step aims to identify the labels of a new data point based on the current clusters. In some cases, some new clusters will be created or the new data points will be integrated with the current clusters. With the deletion process, if we want to remove one or some data points, we need to reform the clusters because some clusters may be affected by these operations. For each kind of clustering, there are some incremental clustering algorithms proposed in the literature such as Incremental K-means [15], IncrementalDBSCAN [16], or Incremental graph clustering [17]. The key idea of these algorithms is that we need to identify the situation for each kind of algorithm for the insertion step and deletion step. The incremental clustering addresses the problem of identifying the label for a new data object or updating clusters when we remove points in the current clusters. This problem is very meaningful when we tackle with the big data in which the data set is too big to fit into the available memory. For each kind of clustering, there are some versions of incremental clustering proposed in the literature.In [16], the Incremental density-based clustering (IncrementalDBSCAN) is introduced. Based on the notion of density-based clustering, the IncrementalDBSCAN can efficiently add and delete points for the current clusters. The adding process of a new point has some cases; for example, the new point can be noise, the new point will be added in a cluster, and the new point can merge some clusters. For the deletion process, the point can be a noise point and the point can split to some clusters or not affect the current clusters. Some cases of the insertion process and deletion process of IncrementalDBSCAN are shown in Figure 3.Figure 3
Insertion cases (a) and deletion cases (b) of IncrementalDBSCAN [16].In [15], a single-pass incremental clustering for large data set based on K-means is introduced (named GenIC). GenIC updates each center with each new data point and merges clusters only at the end of a generation (i.e., window of data). By a generalized incremental algorithm, GenIC algorithm can move a center in the list of centers using a weighted sum of the existing center and the new point presented. The idea of GenIC is to divide the stream of data into chunks or windows as is common with streaming algorithms. We view each chunk of n data points as a generation and think of the “fitness” of a center as being measured by the number of points assigned to it. In general, the fittest centers survive to the next generation, but occasionally new centers are selected and old centers are killed off. The GenIC is compared with K-means and shown the effectiveness in running time and less affected by the choice of initial centers than K-means. In [18], a version of Incremental K-means clustering is also proposed. In the algorithm, clusters are built incrementally by adding one cluster center at a time. In [19], a novel two-phase static single-pass algorithm as well as a dynamic two-phase single-pass algorithm based on Fuzzy C-means have been presented and are showing high utility. The idea behind the multistage methods reported in the paper is that an estimate of the partition matrix and the location of the cluster centers can be obtained by clustering a sample of the data. A small sample is expected to produce a fast yet less reliable estimation of the cluster centers. This leads to a multistage approach, which involves several stages of sampling (with replacement) of the data and estimating the membership matrix for the next stage. The experiments conducted show the effectiveness of the proposed method. In [17], Chandrasekhar et al. propose an incremental local density clustering scheme for finding dense subgraphs in streaming data, i.e., when data arrive incrementally (ILDC). The incremental clustering scheme captures redundancy in the streaming data source, by finding dense subgraphs, which correspond to salient objects and scenes. The ILDC process performs greedy operations like cluster expansion, cluster addition and cluster merging based on the similarity between clusters defined. The ILDC shows the effectiveness when using in image-retrieval applications. In [20], an incremental semisupervised ensemble clustering algorithm has successfully presented, named ISSCE. ISSCE uses constraints to update incremental members. The authors develop an incremental ensemble member selection process based on a global objective function and a local objective function to remove the redundant ensemble members. The experiment results show the improvement of ISSCE over traditional semisupervised clustering ensemble approaches or conventional cluster ensemble methods on six real-world datasets from UCI machine learning repository and 12 real-world data sets of cancer gene expression profiles. In the context of classification, we need to find the label for a new data object by using a classifier trained by data training. The problem of identifying the label for a new object in incremental clustering can be seen similar to classification context.


### 2.2. Outlier Detection Problem

Outlier (anomaly) detection is one of the important problems of machine learning and data mining. As mentioned in [21], outliers detection is the problem of finding patterns in data that do not conform to expected behavior. The applications of outlier detection can be found in many applications such as intrusion detection, credit fraud detection, video surveillance, weather prediction, discovery of criminal activities of electronic commerce, etc. [9, 21]. There are some kinds of outliers including point outliers, contextual outliers, and collective outliers. In this paper, we focus on point outliers detection that can be applied in a variety of applications. For a data set consisting of points, a point will be called outlier if it is different from a large number of the rest of the points. To detect outliers, there are some principal methods in the literature such as classification methods, nearest neighbor methods, clustering methods, statistical methods, distance-based methods, etc.For the classification-based outliers detection, we have two categories: multiclass and one-class anomalies detection methods. In multiclass classification techniques, we assume that the training data contain labeled points of all normal classes. The learner using a supervised learning model trains a model using the labeled data. The classifier can distinguish between each normal class and the rest of the class. A test point will be called outlier if it does not belong to any normal class. In one-class outliers detection methods, we assume that the number of normal class is only one. The classifier learns a model that can detect the boundary of the normal class. If a test point does not fall in the boundary, it will be called outliers. Although many techniques have been done, however, the main disadvantage of these methods based on the availability of accurate labels for normal classes which is not easy to apply for real applications.For the nearest neighbor-based outlier detection methods, we use the assumption as follows: normal points belong to the dense regions, while outliers belong to the sparse regions. The most famous method of this kind is the LOF algorithm. The idea of LOF is based on the local density evaluation score for points. Each point will be assigned a score which is the ratio of the average local density of thek-nearest neighbors of the point and the local density of the data point itself. Many variants of LOF can be cited here such as COF [22], ODIN [11], LOCI [23], etc. The main drawback of the method is the On2 complexity required.For the clustering-based outliers detection techniques, the idea here is using clustering methods to group data into clusters. The points do not belong to any clusters called outliers. Some clustering methods can be detected outliers such as DBSCAN [24], SNN [25], etc. In fact, the purpose of clustering is finding clusters, so the outliers are just the product of the clustering process and hence are not carefully optimized. One more reason that can be made here is the complexity of clustering techniques required On2.In the statistical outliers detection methods, these methods are based on the assumption as follows: normal data points occur in high-probability regions of a stochastic model, while anomalies occur in the low-probability regions of the stochastic model. Some methods have been done for the kind of outliers detections. In general, statistical methods fit a statistical model (Gaussian distribution, the mixture of parametric statistical distribution, etc.) to the given data and then apply a statistical inference test to determine if an unseen instance belongs to this model or not. The key limitation of these methods is the assumption about the distribution of data points. This assumption is not true, especially when the dimension of data is high [21].In the distance-based outliers detection methods, a point is considered as outlier if it does not have enoughpct% points in the data set that distance from this point is smaller than the threshold value dmin [26].


## 2.1. Incremental Clustering

Clustering is the task of partitioning a data set intok clusters in which the points in the same cluster are similar and the points in different clusters are dissimilar. The context of incremental clustering is as follows: given some current clusters, the incremental clustering is one-pass clustering kind which aims to identify cluster label for incremental data points. Incremental clustering is very useful for data stream or dynamic data (data warehouse). In general, the incremental clustering is combined with two processes of insertion and deletion. Given a set of clusters, the insertion step aims to identify the labels of a new data point based on the current clusters. In some cases, some new clusters will be created or the new data points will be integrated with the current clusters. With the deletion process, if we want to remove one or some data points, we need to reform the clusters because some clusters may be affected by these operations. For each kind of clustering, there are some incremental clustering algorithms proposed in the literature such as Incremental K-means [15], IncrementalDBSCAN [16], or Incremental graph clustering [17]. The key idea of these algorithms is that we need to identify the situation for each kind of algorithm for the insertion step and deletion step. The incremental clustering addresses the problem of identifying the label for a new data object or updating clusters when we remove points in the current clusters. This problem is very meaningful when we tackle with the big data in which the data set is too big to fit into the available memory. For each kind of clustering, there are some versions of incremental clustering proposed in the literature.In [16], the Incremental density-based clustering (IncrementalDBSCAN) is introduced. Based on the notion of density-based clustering, the IncrementalDBSCAN can efficiently add and delete points for the current clusters. The adding process of a new point has some cases; for example, the new point can be noise, the new point will be added in a cluster, and the new point can merge some clusters. For the deletion process, the point can be a noise point and the point can split to some clusters or not affect the current clusters. Some cases of the insertion process and deletion process of IncrementalDBSCAN are shown in Figure 3.Figure 3
Insertion cases (a) and deletion cases (b) of IncrementalDBSCAN [16].In [15], a single-pass incremental clustering for large data set based on K-means is introduced (named GenIC). GenIC updates each center with each new data point and merges clusters only at the end of a generation (i.e., window of data). By a generalized incremental algorithm, GenIC algorithm can move a center in the list of centers using a weighted sum of the existing center and the new point presented. The idea of GenIC is to divide the stream of data into chunks or windows as is common with streaming algorithms. We view each chunk of n data points as a generation and think of the “fitness” of a center as being measured by the number of points assigned to it. In general, the fittest centers survive to the next generation, but occasionally new centers are selected and old centers are killed off. The GenIC is compared with K-means and shown the effectiveness in running time and less affected by the choice of initial centers than K-means. In [18], a version of Incremental K-means clustering is also proposed. In the algorithm, clusters are built incrementally by adding one cluster center at a time. In [19], a novel two-phase static single-pass algorithm as well as a dynamic two-phase single-pass algorithm based on Fuzzy C-means have been presented and are showing high utility. The idea behind the multistage methods reported in the paper is that an estimate of the partition matrix and the location of the cluster centers can be obtained by clustering a sample of the data. A small sample is expected to produce a fast yet less reliable estimation of the cluster centers. This leads to a multistage approach, which involves several stages of sampling (with replacement) of the data and estimating the membership matrix for the next stage. The experiments conducted show the effectiveness of the proposed method. In [17], Chandrasekhar et al. propose an incremental local density clustering scheme for finding dense subgraphs in streaming data, i.e., when data arrive incrementally (ILDC). The incremental clustering scheme captures redundancy in the streaming data source, by finding dense subgraphs, which correspond to salient objects and scenes. The ILDC process performs greedy operations like cluster expansion, cluster addition and cluster merging based on the similarity between clusters defined. The ILDC shows the effectiveness when using in image-retrieval applications. In [20], an incremental semisupervised ensemble clustering algorithm has successfully presented, named ISSCE. ISSCE uses constraints to update incremental members. The authors develop an incremental ensemble member selection process based on a global objective function and a local objective function to remove the redundant ensemble members. The experiment results show the improvement of ISSCE over traditional semisupervised clustering ensemble approaches or conventional cluster ensemble methods on six real-world datasets from UCI machine learning repository and 12 real-world data sets of cancer gene expression profiles. In the context of classification, we need to find the label for a new data object by using a classifier trained by data training. The problem of identifying the label for a new object in incremental clustering can be seen similar to classification context.


## 2.2. Outlier Detection Problem

Outlier (anomaly) detection is one of the important problems of machine learning and data mining. As mentioned in [21], outliers detection is the problem of finding patterns in data that do not conform to expected behavior. The applications of outlier detection can be found in many applications such as intrusion detection, credit fraud detection, video surveillance, weather prediction, discovery of criminal activities of electronic commerce, etc. [9, 21]. There are some kinds of outliers including point outliers, contextual outliers, and collective outliers. In this paper, we focus on point outliers detection that can be applied in a variety of applications. For a data set consisting of points, a point will be called outlier if it is different from a large number of the rest of the points. To detect outliers, there are some principal methods in the literature such as classification methods, nearest neighbor methods, clustering methods, statistical methods, distance-based methods, etc.For the classification-based outliers detection, we have two categories: multiclass and one-class anomalies detection methods. In multiclass classification techniques, we assume that the training data contain labeled points of all normal classes. The learner using a supervised learning model trains a model using the labeled data. The classifier can distinguish between each normal class and the rest of the class. A test point will be called outlier if it does not belong to any normal class. In one-class outliers detection methods, we assume that the number of normal class is only one. The classifier learns a model that can detect the boundary of the normal class. If a test point does not fall in the boundary, it will be called outliers. Although many techniques have been done, however, the main disadvantage of these methods based on the availability of accurate labels for normal classes which is not easy to apply for real applications.For the nearest neighbor-based outlier detection methods, we use the assumption as follows: normal points belong to the dense regions, while outliers belong to the sparse regions. The most famous method of this kind is the LOF algorithm. The idea of LOF is based on the local density evaluation score for points. Each point will be assigned a score which is the ratio of the average local density of thek-nearest neighbors of the point and the local density of the data point itself. Many variants of LOF can be cited here such as COF [22], ODIN [11], LOCI [23], etc. The main drawback of the method is the On2 complexity required.For the clustering-based outliers detection techniques, the idea here is using clustering methods to group data into clusters. The points do not belong to any clusters called outliers. Some clustering methods can be detected outliers such as DBSCAN [24], SNN [25], etc. In fact, the purpose of clustering is finding clusters, so the outliers are just the product of the clustering process and hence are not carefully optimized. One more reason that can be made here is the complexity of clustering techniques required On2.In the statistical outliers detection methods, these methods are based on the assumption as follows: normal data points occur in high-probability regions of a stochastic model, while anomalies occur in the low-probability regions of the stochastic model. Some methods have been done for the kind of outliers detections. In general, statistical methods fit a statistical model (Gaussian distribution, the mixture of parametric statistical distribution, etc.) to the given data and then apply a statistical inference test to determine if an unseen instance belongs to this model or not. The key limitation of these methods is the assumption about the distribution of data points. This assumption is not true, especially when the dimension of data is high [21].In the distance-based outliers detection methods, a point is considered as outlier if it does not have enoughpct% points in the data set that distance from this point is smaller than the threshold value dmin [26].


## 3. Proposed Method

### 3.1. Semisupervised Graph-Based Clustering

In recent years, semisupervised clustering is an important research topic that is illustrated by a number of studies introduced [27]. The purpose of semisupervised clustering is to integrate side information for improving the clustering performances. Generally, there are two kinds of side information including constraints and seeds. Given a data set X, constraints involve must-link and cannot-link in which the must-link constraint ML between two observations x∈X and y∈X means that x and y should be in the same cluster, and the cannot-link constraint CL means that x and y should not be in the same cluster. With seeds, a small set of labeled data (called seeds) S∈X will be provided for semisupervised clustering algorithms. In fact, this side information is available or can be collected from users [28–31]. We can cite here the work of semisupervised clustering for K-means [32], hierarchical clustering [33], graph-based clustering [34, 35], spectral clustering [36, 37], density-based clustering [38], etc. While many semisupervised clustering algorithms are introduced, to the best of our knowledge, there are no incremental semisupervised clustering algorithms in the literature.Our new incremental clustering introduced in the next section is based on the work of semisupervised graph-based clustering using seeds (SSGC). We choose the SSGC algorithm because SSGC algorithm has several advantages such as SSGC use only one parameter and SSGC can detect clusters in varied density regions of data [35]. SSGC includes two steps as the following description (see Algorithm 1):Algorithm 1:The algorithm SSGC [35].
Input: X, number of neighbors k, a set of seeds S
Output: A set of detected clusters/outliers
PROCESS:
(1)
Constructing thek-NN graph of X
(2)
θ
=
0
(3)
repeat
(4)
Constructing the connected components using the thresholdθ
(5)
θ=θ+1
(6)
until the cut condition is satisfied
(7)
Propagating the labels to form theprincipal clusters
(8)
Constructing the final clustersStep 1.
Given ak-nearest neighbor graph presenting a data set X, this step uses a loop in which at each step, all edges which have the weight less than threshold θ will be removed. The value of θ is initialized by 0 at the first step and incremented by 1 after each step. This loop will stop when each connected component has at most one kind of seeds. The main clusters are identified by propagating label in each connected component that contains seeds.Step 2.
The remaining points (graph nodes) that do not belong to any main clusters will be divided into two kinds: points that have edges which relate to one or more clusters and other points which are isolated points. In the first case, points will be assigned to the cluster with the largest related weight. For the isolated points, we can either remove them as outliers or label them.
We note that, in SSGC, the weightωxi,xj of the edge (the similarity) between two points xi and xj in the k-nearest neighbor graph is equal to the number of points that the two points share, as the following equation:(1)ωxi,xj=NNxi∩NNxj,where NN⋅ is the set of k-nearest neighbors of the specified point.
SSGC is efficient when compared with the semisupervised density-based clustering in detecting clusters for batch data; however, it is not adapted for data stream or data warehousing environment where many updates (insertion/deletion) occur.


### 3.2. Incremental Graph-Based Clustering Using Seeds

In this section, we propose IncrementalSSGC, based on the SSGC algorithm. In the IncrementalSSGC, the seeds will be used to train ak-nearest neighbor graph to construct connected components and identify the value of θ as in SSGC algorithm. Like other incremental clustering algorithms, two procedures must be developed, including insertion and deletion.Algorithm2 shows the insertion step of IncrementalSSGC for a new data point xnew. At first, the list of edges between xnew and the current clusters is created, and all edges with weight smaller than θ will be removed. If the list is empty, it is illustrated that xnew is an outlier with the current situation, and hence, xnew will be added in a temporary list Lo. In the case of existing edges between xnew and some connected components, we need to remove some edges until xnew connects to components with one kind of label. Finally, the label of xnew will be identified by the label of its connected components. In Step 10, xnew and its related edges will be added to L; some edges between xt and xl will also be recalculated if xnew appears in the nearest neighbors list of xt or xl. In Step 12, after some insertion steps, we can examine the points in Lo.Algorithm 2:IncrementalSSGC: insertion process.
Input: a new data object xnew; a set of current clusters C, list containing edges for each point of current clusters L, θ (threshold), and number of nearest neighbors (NN) k.
Output: label for xnew
Process:
(1)
Create thek-nearest neighbors list of edges LE between xnew and all current clusters
(2)
Delete allu,v∈LE: weightu,v<θ
(3)
if LE=∅ then
(4)
xnew is added in a temporary list Lo
(5)
else
(6)
If xnew related to two or more components with different label then
(7)
Delete edges inLE with ascending order of weight until xnew connecting with components with at most one kind of label
(8)
end if
(9)
Get label forxnew and its connected points (if any) by propagating
(10)
Update listL: adding edges relating to xnew to L; some edges between xt and xl will also be recalculated if xnew appears in the nearest neighbors list of xt or xl.
(11)
end if
(12)
Examine points inLoAlgorithm3 presents the detailed steps of the deletion process. When we want to remove a point xdel from the current clusters, we simply remove xdel and all edges related with xdel in the graph. Step 2 of the algorithm shows the updating process. In this step, we need to update all edges affected by xdel. It means that all edges between xi and xj must be updated if xdel appears in the commune list of the nearest neighbors. Finally, Step 3 is simply to remove all edges that have weight less than θ.Algorithm 3:IncrementalSSGC: deletion process.
Input: an object xdel in a component will be deleted; a set of current clusters C, list of edges for each point of current clusters L, θ (threshold)
Output: the updated C, the updated L,
Process:
(1)
Deletexdel and all edges related to xdel in L
(2)
Update all weightsk,l∈C: xdel∈NNk∩NNl
(3)
Delete all updated (at Step 2)k,l∈ L: weightt,l<θ


#### 3.2.1. The Complexity Analysis

Now, we will analyse the complexity of IncrementalSSGC. Given a data set withn object, we recall that the complexity of SSGC is Ok×n2, in which k is the number of nearest neighbors. Assuming that we have the current clusters including n objects, we will analyse the complexity of the insertion and deletion process of IncrementalSSGC at step n+1 as follows.For the insertion process which aims to identify the cluster label for a new data pointxnew, in Step 1, to create the list of edges between xnew and the current clusters, the complexity is On×k. In Steps 2, 6, and 7, the complexity is just Ok. In Step 10, some edges between xt and xl will also be recalculated if xnew appears in the nearest neighbors list of xt or xl; in fact, the number of such edges is also small. So for the insertion of a new point, the complexity is On×k.For the deletion process, the complexity of Step 1 isOk. In Steps 2 and 3, the number of edges updated is the number of edges that received xdel as commune points, and the value of commune points depends on the data set. Let q be the average value of v deletion processes; in fact, q is determined by perfoming experiments. So, the complexity of a deletion process is Oq×n×k.In summary, with the analysis of the insertion and deletion process above, we can see that it is very useful for data set that we usually need to update. In the next section, we also present the running time of both SSGC and IncrementalSSGC for some data sets extracted from intrusion detection problem.


### 3.3. A Fast Outlier Detection Method

Given ak-nearest neighbors graph (k-NNG), the local density score LDS of a vertex u∈ k-NNG is defined as follows [39]:(2)LDSu=∑q∈NNuωu,qk,in which ω is calculated as in equation (1), and k is the number of nearest neighbors used. The LDS is used as an indicator of the density of the region of a vertex u. The LDS value is in the interval of [0, k – 1]; the larger the LDS of u, the denser the region that u belongs to, and vice versa. So, we can apply the way of LDS's calculation to identify outliers. To detect outlier by this method, we have to use a parameter as the threshold: the point which has LDS value smaller than the threshold can be seen as an outlier and vice versa. Similar to LOF, the method has required On2 of complexity.To reduce the running time of the method, we propose a Fast outlier detection method based on Local Density Score, called FLDS. The basic idea of the algorithm FLDS is to use divide-and-conquer strategy. Given a data setX to find outliers, first, the input data set will be split into k clusters using K-means algorithm. Next, k-nearest neighbor graphs will be used for each cluster and identify outlier on each local cluster. The outliers found in all clusters will be recalculated on the whole data set. The idea of divide-and-conquer strategies by using the K-means in the preprocessing step has been successfully applied in solving some problems such as fast spectral clustering problem [40] and fast minimum spanning tree problem [41] and in the efficient and effective shape-based clustering paper [42]. The FLDS algorithm is described in Algorithm 4.Algorithm 4:Algorithm FLDS.
Input: a data set X with n points, the number of nearest neighbors k, number of clusters nc, theta,
Output: outliers of X,
Process:
(1)
Using K-means to splitX into nc clusters
(2)
Using LDS algorithm on each separate cluster to obtain local outliers (using the thresholdtheta)
(3)
The local outliers obtained in Step 2 will be recalculated LDS’s value across the data setThe FLDS algorithm is an outlier’s detection method based on K-means and local density score using graph. The complexity of FLDS isOn×k+Ok2+Ot×n; in which the value of k may be used up to n0.5 [41, 42]; t≪n is evaluated approximately equal to k; so the complexity of the FLDS is On1.5.


## 3.1. Semisupervised Graph-Based Clustering

In recent years, semisupervised clustering is an important research topic that is illustrated by a number of studies introduced [27]. The purpose of semisupervised clustering is to integrate side information for improving the clustering performances. Generally, there are two kinds of side information including constraints and seeds. Given a data set X, constraints involve must-link and cannot-link in which the must-link constraint ML between two observations x∈X and y∈X means that x and y should be in the same cluster, and the cannot-link constraint CL means that x and y should not be in the same cluster. With seeds, a small set of labeled data (called seeds) S∈X will be provided for semisupervised clustering algorithms. In fact, this side information is available or can be collected from users [28–31]. We can cite here the work of semisupervised clustering for K-means [32], hierarchical clustering [33], graph-based clustering [34, 35], spectral clustering [36, 37], density-based clustering [38], etc. While many semisupervised clustering algorithms are introduced, to the best of our knowledge, there are no incremental semisupervised clustering algorithms in the literature.Our new incremental clustering introduced in the next section is based on the work of semisupervised graph-based clustering using seeds (SSGC). We choose the SSGC algorithm because SSGC algorithm has several advantages such as SSGC use only one parameter and SSGC can detect clusters in varied density regions of data [35]. SSGC includes two steps as the following description (see Algorithm 1):Algorithm 1:The algorithm SSGC [35].
Input: X, number of neighbors k, a set of seeds S
Output: A set of detected clusters/outliers
PROCESS:
(1)
Constructing thek-NN graph of X
(2)
θ
=
0
(3)
repeat
(4)
Constructing the connected components using the thresholdθ
(5)
θ=θ+1
(6)
until the cut condition is satisfied
(7)
Propagating the labels to form theprincipal clusters
(8)
Constructing the final clustersStep 1.
Given ak-nearest neighbor graph presenting a data set X, this step uses a loop in which at each step, all edges which have the weight less than threshold θ will be removed. The value of θ is initialized by 0 at the first step and incremented by 1 after each step. This loop will stop when each connected component has at most one kind of seeds. The main clusters are identified by propagating label in each connected component that contains seeds.Step 2.
The remaining points (graph nodes) that do not belong to any main clusters will be divided into two kinds: points that have edges which relate to one or more clusters and other points which are isolated points. In the first case, points will be assigned to the cluster with the largest related weight. For the isolated points, we can either remove them as outliers or label them.
We note that, in SSGC, the weightωxi,xj of the edge (the similarity) between two points xi and xj in the k-nearest neighbor graph is equal to the number of points that the two points share, as the following equation:(1)ωxi,xj=NNxi∩NNxj,where NN⋅ is the set of k-nearest neighbors of the specified point.
SSGC is efficient when compared with the semisupervised density-based clustering in detecting clusters for batch data; however, it is not adapted for data stream or data warehousing environment where many updates (insertion/deletion) occur.


## 3.2. Incremental Graph-Based Clustering Using Seeds

In this section, we propose IncrementalSSGC, based on the SSGC algorithm. In the IncrementalSSGC, the seeds will be used to train ak-nearest neighbor graph to construct connected components and identify the value of θ as in SSGC algorithm. Like other incremental clustering algorithms, two procedures must be developed, including insertion and deletion.Algorithm2 shows the insertion step of IncrementalSSGC for a new data point xnew. At first, the list of edges between xnew and the current clusters is created, and all edges with weight smaller than θ will be removed. If the list is empty, it is illustrated that xnew is an outlier with the current situation, and hence, xnew will be added in a temporary list Lo. In the case of existing edges between xnew and some connected components, we need to remove some edges until xnew connects to components with one kind of label. Finally, the label of xnew will be identified by the label of its connected components. In Step 10, xnew and its related edges will be added to L; some edges between xt and xl will also be recalculated if xnew appears in the nearest neighbors list of xt or xl. In Step 12, after some insertion steps, we can examine the points in Lo.Algorithm 2:IncrementalSSGC: insertion process.
Input: a new data object xnew; a set of current clusters C, list containing edges for each point of current clusters L, θ (threshold), and number of nearest neighbors (NN) k.
Output: label for xnew
Process:
(1)
Create thek-nearest neighbors list of edges LE between xnew and all current clusters
(2)
Delete allu,v∈LE: weightu,v<θ
(3)
if LE=∅ then
(4)
xnew is added in a temporary list Lo
(5)
else
(6)
If xnew related to two or more components with different label then
(7)
Delete edges inLE with ascending order of weight until xnew connecting with components with at most one kind of label
(8)
end if
(9)
Get label forxnew and its connected points (if any) by propagating
(10)
Update listL: adding edges relating to xnew to L; some edges between xt and xl will also be recalculated if xnew appears in the nearest neighbors list of xt or xl.
(11)
end if
(12)
Examine points inLoAlgorithm3 presents the detailed steps of the deletion process. When we want to remove a point xdel from the current clusters, we simply remove xdel and all edges related with xdel in the graph. Step 2 of the algorithm shows the updating process. In this step, we need to update all edges affected by xdel. It means that all edges between xi and xj must be updated if xdel appears in the commune list of the nearest neighbors. Finally, Step 3 is simply to remove all edges that have weight less than θ.Algorithm 3:IncrementalSSGC: deletion process.
Input: an object xdel in a component will be deleted; a set of current clusters C, list of edges for each point of current clusters L, θ (threshold)
Output: the updated C, the updated L,
Process:
(1)
Deletexdel and all edges related to xdel in L
(2)
Update all weightsk,l∈C: xdel∈NNk∩NNl
(3)
Delete all updated (at Step 2)k,l∈ L: weightt,l<θ


### 3.2.1. The Complexity Analysis

Now, we will analyse the complexity of IncrementalSSGC. Given a data set withn object, we recall that the complexity of SSGC is Ok×n2, in which k is the number of nearest neighbors. Assuming that we have the current clusters including n objects, we will analyse the complexity of the insertion and deletion process of IncrementalSSGC at step n+1 as follows.For the insertion process which aims to identify the cluster label for a new data pointxnew, in Step 1, to create the list of edges between xnew and the current clusters, the complexity is On×k. In Steps 2, 6, and 7, the complexity is just Ok. In Step 10, some edges between xt and xl will also be recalculated if xnew appears in the nearest neighbors list of xt or xl; in fact, the number of such edges is also small. So for the insertion of a new point, the complexity is On×k.For the deletion process, the complexity of Step 1 isOk. In Steps 2 and 3, the number of edges updated is the number of edges that received xdel as commune points, and the value of commune points depends on the data set. Let q be the average value of v deletion processes; in fact, q is determined by perfoming experiments. So, the complexity of a deletion process is Oq×n×k.In summary, with the analysis of the insertion and deletion process above, we can see that it is very useful for data set that we usually need to update. In the next section, we also present the running time of both SSGC and IncrementalSSGC for some data sets extracted from intrusion detection problem.


## 3.2.1. The Complexity Analysis

Now, we will analyse the complexity of IncrementalSSGC. Given a data set withn object, we recall that the complexity of SSGC is Ok×n2, in which k is the number of nearest neighbors. Assuming that we have the current clusters including n objects, we will analyse the complexity of the insertion and deletion process of IncrementalSSGC at step n+1 as follows.For the insertion process which aims to identify the cluster label for a new data pointxnew, in Step 1, to create the list of edges between xnew and the current clusters, the complexity is On×k. In Steps 2, 6, and 7, the complexity is just Ok. In Step 10, some edges between xt and xl will also be recalculated if xnew appears in the nearest neighbors list of xt or xl; in fact, the number of such edges is also small. So for the insertion of a new point, the complexity is On×k.For the deletion process, the complexity of Step 1 isOk. In Steps 2 and 3, the number of edges updated is the number of edges that received xdel as commune points, and the value of commune points depends on the data set. Let q be the average value of v deletion processes; in fact, q is determined by perfoming experiments. So, the complexity of a deletion process is Oq×n×k.In summary, with the analysis of the insertion and deletion process above, we can see that it is very useful for data set that we usually need to update. In the next section, we also present the running time of both SSGC and IncrementalSSGC for some data sets extracted from intrusion detection problem.


## 3.3. A Fast Outlier Detection Method

Given ak-nearest neighbors graph (k-NNG), the local density score LDS of a vertex u∈ k-NNG is defined as follows [39]:(2)LDSu=∑q∈NNuωu,qk,in which ω is calculated as in equation (1), and k is the number of nearest neighbors used. The LDS is used as an indicator of the density of the region of a vertex u. The LDS value is in the interval of [0, k – 1]; the larger the LDS of u, the denser the region that u belongs to, and vice versa. So, we can apply the way of LDS's calculation to identify outliers. To detect outlier by this method, we have to use a parameter as the threshold: the point which has LDS value smaller than the threshold can be seen as an outlier and vice versa. Similar to LOF, the method has required On2 of complexity.To reduce the running time of the method, we propose a Fast outlier detection method based on Local Density Score, called FLDS. The basic idea of the algorithm FLDS is to use divide-and-conquer strategy. Given a data setX to find outliers, first, the input data set will be split into k clusters using K-means algorithm. Next, k-nearest neighbor graphs will be used for each cluster and identify outlier on each local cluster. The outliers found in all clusters will be recalculated on the whole data set. The idea of divide-and-conquer strategies by using the K-means in the preprocessing step has been successfully applied in solving some problems such as fast spectral clustering problem [40] and fast minimum spanning tree problem [41] and in the efficient and effective shape-based clustering paper [42]. The FLDS algorithm is described in Algorithm 4.Algorithm 4:Algorithm FLDS.
Input: a data set X with n points, the number of nearest neighbors k, number of clusters nc, theta,
Output: outliers of X,
Process:
(1)
Using K-means to splitX into nc clusters
(2)
Using LDS algorithm on each separate cluster to obtain local outliers (using the thresholdtheta)
(3)
The local outliers obtained in Step 2 will be recalculated LDS’s value across the data setThe FLDS algorithm is an outlier’s detection method based on K-means and local density score using graph. The complexity of FLDS isOn×k+Ok2+Ot×n; in which the value of k may be used up to n0.5 [41, 42]; t≪n is evaluated approximately equal to k; so the complexity of the FLDS is On1.5.


## 4. Experiment Results

This section aims to evaluate the effectiveness of our proposed algorithms. We will show the results of the IncrementalSSGC, the results of FLDS, and the results when using our methods for a hybrid framework for intrusion detection problem. The IncrementalSSGC will be compared with the IncrementalDBSCAN, while the FLDS will be compared with the LOF.The data sets used in the experiments are mostly extracted from the Aegean WiFi Intrusion Dataset (AWID) [14]. AWID is a publicly available collection of sets of data in an easily distributed format, which contain real traces of both the normal and intrusive 802.11 traffic. In the AWID, many kinds of attacks have been introduced, but they also fall into four main categories including flooding, injection, and impersonation. The AWID has 156 attributes, we use 35 attributes extracted by an artificial neural network, as presented in [8]. We also use some supplement data sets that come from UCI [43] and data sets with different size, shape, and density and contain noise points as well as special artifacts [44] in this experiment.


### 4.1. Experiment Setup

#### 4.1.1. Data Sets for Incremental Clustering Algorithms

To show the effectiveness of the IncrementalSSGC, two aspects will be examined including the running time and accuracy. 5 UCI data sets and 3 data sets extracted from AWID will be used for testing IncrementalSSGC and IncrementalDBSCAN. The details of these data sets are presented in Table1.Table 1
Main characteristics for clustering evaluation.
ID
Data
#Normal + impers.
#Attributes
#Clusters
1
Iris
150
4
3
3
Wine
178
13
3
2
E coli
336
8
8
4
Breast
569
30
2
5
Yeast
1484
8
10
6
AWID1
5000
35
2
7
AWID2
8000
35
2
8
AWID3
12000
35
2To evaluate clustering results, the Rand Index is used. Given a data setX with n points for clustering, P1 is an array containing the true labels, P2 is an array containing the results of a clustering algorithm, the Rand Index (RI) is calculated as follows:(3)RI=a+bn!/2!n−2!,in which a/b is the number of pairs that are in the same/different clusters in both partitions P1 and P2. The bigger the Rand Index, the better the result.


#### 4.1.2. Data Sets for FLDS and LOF

We used 5 data sets extracted from AWDI and four 2D data sets including DS1 (10000 points), DS2 (8000 points), DS3 (8000 points), and DS4 (8000 points) [44] for FLDS and LOF. These 2D data sets have clusters of different size, shape, and orientation, as well as random noise points and special artifacts. The details of these AWID data sets are presented in Table 2.Table 2
Main characteristics for FLDS and LOF.
ID
Data
#Objects
Categories
1
O-AWID1
3030
Impers., flooding, injections
3
O-AWID2
5030
Impers., normal, flooding
2
O-AWID3
7040
Flooding, normal, impers.
4
O-AWID4
10040
Normal, impers., injection, flooding
5
O-AWID5
15050
Normal, flooding, injection, and impers.To compare LOF and FLDS for AWID data sets, we use the ROC measure that has two factors including False Positive (False Alarm) Rate (FPR) and False Negative (Miss Detection) Rate (FNR). The detail of these factors is shown in the following equations:(4)FPR=FPFP+TN,(5)FNR=FNTP+FN,in which True Positive (TP) is the number of attacks correctly classified as attack; True Negative (TN) is the number of normal correctly detected as normal; False Positive (FP) is the number of normal falsely classified as attacks, namely false alarm; and False Negative (FN) is the number of attacks falsely detected as normal.To combine FPR and FNR values, we calculate the Half Total Error Rate (HTER) that is similar to the evaluation method used in [11], defined as follows:(6)HTER=FPR+FNR2.


### 4.2. Clustering Results

We note that there is no incremental semisupervised clustering algorithm in the literature. So we compare the performance obtained by our algorithm and the IncrementalDBSCAN algorithm. IncrementalDBSCAN can be seen as the state of the art among Incremental clustering proposed. The algorithm can detect clusters with different size and shape with noises. Because both SSGC and IncrementalSSGC produce the same results, we just show the results for IncrementalSSGC and IncrementalDBSCAN. The results are shown in Figure4.Figure 4
Clustering results obtained by IncrementalDBSCAN and IncrementalSSGC for 8 data set of Table1, respectively.We can see from the figure that the IncrementalSSGC obtains better results compared with the IncrementalDBSCAN. It can be explained by the fact that the IncrementalDBSCAN cannot detect clusters with different densities as mentioned in the paper…we assumed that the parameter values Eps and MinPts of DBSCAN do not change significantly when inserting and deleting objects…. This assumption means that the IncrementalDBSCAN cannot work well with the data set having different densities. In contrary to IncrementalDBSCAN, the algorithm IncrementalSSGC does not depend on the density of the data because the similarity measure used is based on shared nearest neighbors.


#### 4.2.1. Running Time Comparison

Figure5 presents the running time for IncrementalSSGC and IncrementalDBSCAN for three AWID data sets. We can see the running time of both algorithms is similar. It can be explained by the fact that both algorithms use k-nearest neighbor to find clusters for each step of incremental. We also present the running time of the SSGC algorithm for reference purpose. From this experiment, we can see advantages of the incremental clustering algorithms.Figure 5
Running time comparison between IncrementalSSGC and IncrementalDBSCAN.


### 4.3. The Results of FLDS and LOF

Table3 presents the results obtained by FLDS and LOF for 5 AWID data sets. We can see that the results of FLDS are comparable with the algorithm LOF. The parameters used for both methods are shown in Table 4. For some 2D data sets, Figure 6 presents the results obtained by FLDS and LOF. Intuitively, the outliers detected by both methods are mostly similar. We can explain the results by the fact that the strategy for evaluating a point is outlier or not based on local density score.Table 3
The HTER measure of LOF and FLDS (the smaller, the better) for some extracted AWID data sets.
Methods
O-AWID1
O-AWID2
O-AWID3
O-AWID4
O-AWID5
FLDS
0.13
0.12
0.10
0.11
0.06
LOF
0.23
0.11
0.11
0.09
0.09Table 4
The parameters used in data sets.
Methods
O-AWID1
O-AWID2
O-AWID3
O-AWID4
O-AWID5
FLDS (k, nc,θ)
(25, 30, 6)
(25, 30, 6)
(25, 30, 6)
(25, 45, 6)
(25, 45, 6)
LOF (MinPts,η)
(27, 1.2)
(27, 1.2)
(25, 1.2)
(25, 1.2)
(27, 1.2)
k: the number of nearest neighbors; nc: number of cluster used; θ: the threshold.Figure 6
Results of LOF (a) and FLDS (b) on some 2D data sets: the outliers marked as red plus.
(a)
(b)Figures7 and 8 illustrate the running time comparison between FLDS and LOF. With 4 data sets mentioned above, it can be seen from the figure that the calculation time of FLDS is about 12 times faster than the running time of LOF. This is the significant improvement compared with LOF. It can be explained by the fact that the complexity of FLDS is just On1.5 compared with On2 of LOF.Figure 7
Running time comparison between FLDS and LOF for four 2D data sets.Figure 8
Running time comparison between FLDS and LOF for five AWID data sets.


### 4.4. A Framework for Intrusion Detection in 802.11 Networks

In this section, we propose a multistage system-based machine learning techniques applied for the AWDI data set. The detail of our system is presented in Figure9. Three components are used for intrusion detection task: a supervised learning model (J48, Bayes, random forest, support vector machine, neural network, etc.) trained by labeled data set, and this model can be seen as misuse detection component; an outlier detection method (LOF, FLDS, etc.) is optionally used to detect new attacks in some periods of time; additionally, for the AWID data sets as presented above, it is very difficult to detect impersonation attacks, so we use an Incremental clustering algorithm (IncrementalDBSCAN, IncrementalSSGC, etc.) for further finding this kind of attack.Figure 9
A new framework for intrusion detection in 802.11 networks.In this experiment, we use J48 for the misuse detection process and IncrementalSSGC for the detecting impersonation attacks. In the outliers detection step, we propose to use FLDS or LOF, and the results have been presented in the subsection above. Because the outliers detection step can be realized offline for some periods of time, we just show the results obtained by combining J48 and IncrementalSSGC. The confusion matrix of these results is illustrated in Table5. The total accuracy obtained 98.9% compared with 96.26% in the paper [14]. We can explain the results obtained by IncrementalSSGC by the fact that the algorithm used the distance based on shared nearest neighbors, which overcome the limit of transitional distance measures such as Euclidean or Minskovki distance, and the shared nearest neighbors measure does not depend on the density of data. This proposed system is generally called hybrid method which is one of the best strategies in developing Intrusion Detection Systems [7, 9] in which there is no single classifier that can exactly detect all kinds of classes.Table 5
Confusion matrix for AWID data set using J48 and IncrementalSSGC in proposed framework.
Normal
Flooding
Impersonation
Injection
Classification
530588
116
6
75
Normal
2553
5544
0
0
Flooding
2
0
16680
0
Injection
3297
148
0
16364
ImpersonationWe also note that for real applications, whenever an attack appears, the system needs to immediately produce a warning. The multistage system-based machine learning techniques provide a solution for users for constructing the real IDS/IPS system that is one of the most important problems in the network security.


## 4.1. Experiment Setup

### 4.1.1. Data Sets for Incremental Clustering Algorithms

To show the effectiveness of the IncrementalSSGC, two aspects will be examined including the running time and accuracy. 5 UCI data sets and 3 data sets extracted from AWID will be used for testing IncrementalSSGC and IncrementalDBSCAN. The details of these data sets are presented in Table1.Table 1
Main characteristics for clustering evaluation.
ID
Data
#Normal + impers.
#Attributes
#Clusters
1
Iris
150
4
3
3
Wine
178
13
3
2
E coli
336
8
8
4
Breast
569
30
2
5
Yeast
1484
8
10
6
AWID1
5000
35
2
7
AWID2
8000
35
2
8
AWID3
12000
35
2To evaluate clustering results, the Rand Index is used. Given a data setX with n points for clustering, P1 is an array containing the true labels, P2 is an array containing the results of a clustering algorithm, the Rand Index (RI) is calculated as follows:(3)RI=a+bn!/2!n−2!,in which a/b is the number of pairs that are in the same/different clusters in both partitions P1 and P2. The bigger the Rand Index, the better the result.


### 4.1.2. Data Sets for FLDS and LOF

We used 5 data sets extracted from AWDI and four 2D data sets including DS1 (10000 points), DS2 (8000 points), DS3 (8000 points), and DS4 (8000 points) [44] for FLDS and LOF. These 2D data sets have clusters of different size, shape, and orientation, as well as random noise points and special artifacts. The details of these AWID data sets are presented in Table 2.Table 2
Main characteristics for FLDS and LOF.
ID
Data
#Objects
Categories
1
O-AWID1
3030
Impers., flooding, injections
3
O-AWID2
5030
Impers., normal, flooding
2
O-AWID3
7040
Flooding, normal, impers.
4
O-AWID4
10040
Normal, impers., injection, flooding
5
O-AWID5
15050
Normal, flooding, injection, and impers.To compare LOF and FLDS for AWID data sets, we use the ROC measure that has two factors including False Positive (False Alarm) Rate (FPR) and False Negative (Miss Detection) Rate (FNR). The detail of these factors is shown in the following equations:(4)FPR=FPFP+TN,(5)FNR=FNTP+FN,in which True Positive (TP) is the number of attacks correctly classified as attack; True Negative (TN) is the number of normal correctly detected as normal; False Positive (FP) is the number of normal falsely classified as attacks, namely false alarm; and False Negative (FN) is the number of attacks falsely detected as normal.To combine FPR and FNR values, we calculate the Half Total Error Rate (HTER) that is similar to the evaluation method used in [11], defined as follows:(6)HTER=FPR+FNR2.


## 4.1.1. Data Sets for Incremental Clustering Algorithms

To show the effectiveness of the IncrementalSSGC, two aspects will be examined including the running time and accuracy. 5 UCI data sets and 3 data sets extracted from AWID will be used for testing IncrementalSSGC and IncrementalDBSCAN. The details of these data sets are presented in Table1.Table 1
Main characteristics for clustering evaluation.
ID
Data
#Normal + impers.
#Attributes
#Clusters
1
Iris
150
4
3
3
Wine
178
13
3
2
E coli
336
8
8
4
Breast
569
30
2
5
Yeast
1484
8
10
6
AWID1
5000
35
2
7
AWID2
8000
35
2
8
AWID3
12000
35
2To evaluate clustering results, the Rand Index is used. Given a data setX with n points for clustering, P1 is an array containing the true labels, P2 is an array containing the results of a clustering algorithm, the Rand Index (RI) is calculated as follows:(3)RI=a+bn!/2!n−2!,in which a/b is the number of pairs that are in the same/different clusters in both partitions P1 and P2. The bigger the Rand Index, the better the result.


## 4.1.2. Data Sets for FLDS and LOF

We used 5 data sets extracted from AWDI and four 2D data sets including DS1 (10000 points), DS2 (8000 points), DS3 (8000 points), and DS4 (8000 points) [44] for FLDS and LOF. These 2D data sets have clusters of different size, shape, and orientation, as well as random noise points and special artifacts. The details of these AWID data sets are presented in Table 2.Table 2
Main characteristics for FLDS and LOF.
ID
Data
#Objects
Categories
1
O-AWID1
3030
Impers., flooding, injections
3
O-AWID2
5030
Impers., normal, flooding
2
O-AWID3
7040
Flooding, normal, impers.
4
O-AWID4
10040
Normal, impers., injection, flooding
5
O-AWID5
15050
Normal, flooding, injection, and impers.To compare LOF and FLDS for AWID data sets, we use the ROC measure that has two factors including False Positive (False Alarm) Rate (FPR) and False Negative (Miss Detection) Rate (FNR). The detail of these factors is shown in the following equations:(4)FPR=FPFP+TN,(5)FNR=FNTP+FN,in which True Positive (TP) is the number of attacks correctly classified as attack; True Negative (TN) is the number of normal correctly detected as normal; False Positive (FP) is the number of normal falsely classified as attacks, namely false alarm; and False Negative (FN) is the number of attacks falsely detected as normal.To combine FPR and FNR values, we calculate the Half Total Error Rate (HTER) that is similar to the evaluation method used in [11], defined as follows:(6)HTER=FPR+FNR2.


## 4.2. Clustering Results

We note that there is no incremental semisupervised clustering algorithm in the literature. So we compare the performance obtained by our algorithm and the IncrementalDBSCAN algorithm. IncrementalDBSCAN can be seen as the state of the art among Incremental clustering proposed. The algorithm can detect clusters with different size and shape with noises. Because both SSGC and IncrementalSSGC produce the same results, we just show the results for IncrementalSSGC and IncrementalDBSCAN. The results are shown in Figure4.Figure 4
Clustering results obtained by IncrementalDBSCAN and IncrementalSSGC for 8 data set of Table1, respectively.We can see from the figure that the IncrementalSSGC obtains better results compared with the IncrementalDBSCAN. It can be explained by the fact that the IncrementalDBSCAN cannot detect clusters with different densities as mentioned in the paper…we assumed that the parameter values Eps and MinPts of DBSCAN do not change significantly when inserting and deleting objects…. This assumption means that the IncrementalDBSCAN cannot work well with the data set having different densities. In contrary to IncrementalDBSCAN, the algorithm IncrementalSSGC does not depend on the density of the data because the similarity measure used is based on shared nearest neighbors.


### 4.2.1. Running Time Comparison

Figure5 presents the running time for IncrementalSSGC and IncrementalDBSCAN for three AWID data sets. We can see the running time of both algorithms is similar. It can be explained by the fact that both algorithms use k-nearest neighbor to find clusters for each step of incremental. We also present the running time of the SSGC algorithm for reference purpose. From this experiment, we can see advantages of the incremental clustering algorithms.Figure 5
Running time comparison between IncrementalSSGC and IncrementalDBSCAN.


## 4.2.1. Running Time Comparison

Figure5 presents the running time for IncrementalSSGC and IncrementalDBSCAN for three AWID data sets. We can see the running time of both algorithms is similar. It can be explained by the fact that both algorithms use k-nearest neighbor to find clusters for each step of incremental. We also present the running time of the SSGC algorithm for reference purpose. From this experiment, we can see advantages of the incremental clustering algorithms.Figure 5
Running time comparison between IncrementalSSGC and IncrementalDBSCAN.


## 4.3. The Results of FLDS and LOF

Table3 presents the results obtained by FLDS and LOF for 5 AWID data sets. We can see that the results of FLDS are comparable with the algorithm LOF. The parameters used for both methods are shown in Table 4. For some 2D data sets, Figure 6 presents the results obtained by FLDS and LOF. Intuitively, the outliers detected by both methods are mostly similar. We can explain the results by the fact that the strategy for evaluating a point is outlier or not based on local density score.Table 3
The HTER measure of LOF and FLDS (the smaller, the better) for some extracted AWID data sets.
Methods
O-AWID1
O-AWID2
O-AWID3
O-AWID4
O-AWID5
FLDS
0.13
0.12
0.10
0.11
0.06
LOF
0.23
0.11
0.11
0.09
0.09Table 4
The parameters used in data sets.
Methods
O-AWID1
O-AWID2
O-AWID3
O-AWID4
O-AWID5
FLDS (k, nc,θ)
(25, 30, 6)
(25, 30, 6)
(25, 30, 6)
(25, 45, 6)
(25, 45, 6)
LOF (MinPts,η)
(27, 1.2)
(27, 1.2)
(25, 1.2)
(25, 1.2)
(27, 1.2)
k: the number of nearest neighbors; nc: number of cluster used; θ: the threshold.Figure 6
Results of LOF (a) and FLDS (b) on some 2D data sets: the outliers marked as red plus.
(a)
(b)Figures7 and 8 illustrate the running time comparison between FLDS and LOF. With 4 data sets mentioned above, it can be seen from the figure that the calculation time of FLDS is about 12 times faster than the running time of LOF. This is the significant improvement compared with LOF. It can be explained by the fact that the complexity of FLDS is just On1.5 compared with On2 of LOF.Figure 7
Running time comparison between FLDS and LOF for four 2D data sets.Figure 8
Running time comparison between FLDS and LOF for five AWID data sets.


## 4.4. A Framework for Intrusion Detection in 802.11 Networks

In this section, we propose a multistage system-based machine learning techniques applied for the AWDI data set. The detail of our system is presented in Figure9. Three components are used for intrusion detection task: a supervised learning model (J48, Bayes, random forest, support vector machine, neural network, etc.) trained by labeled data set, and this model can be seen as misuse detection component; an outlier detection method (LOF, FLDS, etc.) is optionally used to detect new attacks in some periods of time; additionally, for the AWID data sets as presented above, it is very difficult to detect impersonation attacks, so we use an Incremental clustering algorithm (IncrementalDBSCAN, IncrementalSSGC, etc.) for further finding this kind of attack.Figure 9
A new framework for intrusion detection in 802.11 networks.In this experiment, we use J48 for the misuse detection process and IncrementalSSGC for the detecting impersonation attacks. In the outliers detection step, we propose to use FLDS or LOF, and the results have been presented in the subsection above. Because the outliers detection step can be realized offline for some periods of time, we just show the results obtained by combining J48 and IncrementalSSGC. The confusion matrix of these results is illustrated in Table5. The total accuracy obtained 98.9% compared with 96.26% in the paper [14]. We can explain the results obtained by IncrementalSSGC by the fact that the algorithm used the distance based on shared nearest neighbors, which overcome the limit of transitional distance measures such as Euclidean or Minskovki distance, and the shared nearest neighbors measure does not depend on the density of data. This proposed system is generally called hybrid method which is one of the best strategies in developing Intrusion Detection Systems [7, 9] in which there is no single classifier that can exactly detect all kinds of classes.Table 5
Confusion matrix for AWID data set using J48 and IncrementalSSGC in proposed framework.
Normal
Flooding
Impersonation
Injection
Classification
530588
116
6
75
Normal
2553
5544
0
0
Flooding
2
0
16680
0
Injection
3297
148
0
16364
ImpersonationWe also note that for real applications, whenever an attack appears, the system needs to immediately produce a warning. The multistage system-based machine learning techniques provide a solution for users for constructing the real IDS/IPS system that is one of the most important problems in the network security.


## 5. Conclusion

This paper introduces an incremental semisupervised graph-based clustering and a fast outlier detection method. Both methods can be used in a hybrid framework for the intrusion detection problem of WiFi data sets (AWID). Our proposed multistage system-based machine learning techniques provide a solution to guideline for constructing the real IDS/IPS system that is one of the most important problems in the network security. Experiments conducted on the extracted data sets from the AWID and UCI show the effectiveness of our proposed methods. In the near future, we will continue to develop other kinds of machine learning methods for intrusion detection problem and test for other experimental setup.



---

*Source: 4708201-2019-04-28.xml*