文章基本信息

标题：Visualize Network Anomaly Detection by Using K-Means Clustering Algorithm
本地全文：下载
作者：A. M. Riad ; Ibrahim Elhenawy ; Ahmed Hassan 等
期刊名称：International Journal of Computer Networks & Communications
印刷版ISSN：0975-2293
电子版ISSN：0974-9322
出版年度：2013
卷号：5
期号：5
DOI：10.5121/ijcnc.2013.5514195
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：With the ever increasing amount of new attacks in today's world the amount of data will keep increasing, and because of the base-rate fallacy the amount of false alarms will also increase. Another problem with detection of attacks is that they usually isn't detected until after the attack has taken place, this makes defending against attacks hard and can easily lead to disclosure of sensitive information. In this paper we choose K-means algorithm with the Kdd Cup 1999 network data set to evaluate the performance of an unsupervised learning method for anomaly detection. The results of the evaluation showed that a high detection rate can be achieve while maintaining a low false alarm rate .This paper presents the result of using k-means clustering by applying Cluster 3.0 tool and visualized this result by using TreeView visualization tool
关键词：Intrusion detection; Clustering; K-means; Kdd Cup 99; Cluster 3.0; Visualization; TreeView