Javascript must be enabled to continue!
Network Traffic Anomaly Detection Based on Incremental Possibilistic Clustering Algorithm
View through CrossRef
Abstract
This paper proposed a Mahalanobis distance based Incremental Possibilistic Clustering (IPC) algorithm to detect abnormal flow. Firstly, the attributes of network flow is extracted by damped incremental statistics. Then the model of normal traffic will be generated by IPC algorithm. To extract the model of high-dimensional data without pre-known number of cluster centers, the algorithm gradually choose outliers as new clustering centers and merges the overlapping clustering centers. Finally, the data that doesn’t belong to any normal model is regarded as abnormal data. By using the Mahalanobis distance instead of the traditional Euclidean distance, the defect that the possibilistic clustering tends to find the features of hypersphere is solved. The experiments show that this method can distinguish normal flow and abnormal flow effectively and reaches the detection rate of 98%.
Title: Network Traffic Anomaly Detection Based on Incremental Possibilistic Clustering Algorithm
Description:
Abstract
This paper proposed a Mahalanobis distance based Incremental Possibilistic Clustering (IPC) algorithm to detect abnormal flow.
Firstly, the attributes of network flow is extracted by damped incremental statistics.
Then the model of normal traffic will be generated by IPC algorithm.
To extract the model of high-dimensional data without pre-known number of cluster centers, the algorithm gradually choose outliers as new clustering centers and merges the overlapping clustering centers.
Finally, the data that doesn’t belong to any normal model is regarded as abnormal data.
By using the Mahalanobis distance instead of the traditional Euclidean distance, the defect that the possibilistic clustering tends to find the features of hypersphere is solved.
The experiments show that this method can distinguish normal flow and abnormal flow effectively and reaches the detection rate of 98%.
Related Results
Traffic Prediction in 5G Networks Using Machine Learning
Traffic Prediction in 5G Networks Using Machine Learning
The advent of 5G technology promises a paradigm shift in the realm of
telecommunications, offering unprecedented speeds and connectivity. However, the
...
Three-valued possibilistic networks
Three-valued possibilistic networks
Possibilistic networks are graphical models that compactly encode joint possibility distributions. This paper studies a new form of possibilistic graphical models called three-valu...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Renyi entropy-driven network traffic anomaly detection with dynamic threshold
Renyi entropy-driven network traffic anomaly detection with dynamic threshold
AbstractNetwork traffic anomaly detection is a critical issue in network security. Existing Abnormal traffic detection methods rely on statistical-based or anomaly-based approaches...
TYPES OF AI ALGORİTHMS USED İN TRAFFİC FLOW PREDİCTİON
TYPES OF AI ALGORİTHMS USED İN TRAFFİC FLOW PREDİCTİON
The increasing complexity of urban transportation systems and the growing volume of vehicles have made traffic congestion a persistent challenge in modern cities. Efficient traffic...
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
In the process of parallel density clustering, the boundary points of clusters with different densities are blurred and there is data noise, which affects the clustering performanc...
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
<p>Clustering is an important technique for data analysis and knowledge discovery. In the context of big data, the density-based clustering algorithm faces three challenging ...
Network structure optimization algorithm for information propagation considering edge clustering and diffusion characteristics
Network structure optimization algorithm for information propagation considering edge clustering and diffusion characteristics
Optimizing network structure to promote information propagation has been a key issue in the research field of complex network, and both clustering and diffusion characteristics of ...

