Geodesic
A K-means algorithm based on characteristics of density applied to network intrusion detection
Computer Science and Information Systems, Tome 17 (2020) no. 2.

Voir la notice de l'article provenant de la source Computer Science and Information Systems website

K-means algorithms are a group of popular unsupervised algorithms widely used for cluster analysis. However, the results of traditional K-means clustering algorithms are greatly affected by the initial clustering center, with unstable accuracy and low speed, which makes the algorithm hard to meet the requirements for Big Data. In this paper, a modernized version of the K-means algorithm based on density to select the initial seed of clustering is proposed. Firstly, Kd-tree is used to divide the hyper-rectangle space, so those points close to each other are grouped into the same sub-tree during data pre-processing, and the generalized information is stored in the tree structure. Besides, an improved Kd-tree nearest neighbor search is used in the K-means algorithm to prune the search space and optimize the operation for speedup. The clustering results show that the clusters are stable and accurate when the numbers of clusters and iterations are constant. Experimental results in the network intrusion detection case show that the improved version of the K-means algorithms performs better in terms of detection rate and false rate.
Keywords: Network security; K-means; Kd-tree; Network intrusion detection 
@article{CSIS_2020_17_2_a15,
     author = {Jing Xu and Dezhi Han and Kuan-Ching Li and Hai Jiang},
     title = {A {K-means} algorithm based on characteristics of density applied to network intrusion detection},
     journal = {Computer Science and Information Systems},
     publisher = {mathdoc},
     volume = {17},
     number = {2},
     year = {2020},
     url = {http://geodesic.mathdoc.fr/item/CSIS_2020_17_2_a15/}
}
TY  - JOUR
AU  - Jing Xu
AU  - Dezhi Han
AU  - Kuan-Ching Li
AU  - Hai Jiang
TI  - A K-means algorithm based on characteristics of density applied to network intrusion detection
JO  - Computer Science and Information Systems
PY  - 2020
VL  - 17
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CSIS_2020_17_2_a15/
ID  - CSIS_2020_17_2_a15
ER  - 
%0 Journal Article
%A Jing Xu
%A Dezhi Han
%A Kuan-Ching Li
%A Hai Jiang
%T A K-means algorithm based on characteristics of density applied to network intrusion detection
%J Computer Science and Information Systems
%D 2020
%V 17
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CSIS_2020_17_2_a15/
%F CSIS_2020_17_2_a15
Jing Xu; Dezhi Han; Kuan-Ching Li; Hai Jiang. A K-means algorithm based on characteristics of density applied to network intrusion detection. Computer Science and Information Systems, Tome 17 (2020) no. 2. http://geodesic.mathdoc.fr/item/CSIS_2020_17_2_a15/