An Effective Distance-Computing Method for Network Anomaly Detection

作者: Guo-Hui Zhou

DOI: 10.1007/978-3-642-27189-2_19

关键词:

摘要: Currentlymany traditional network anomaly detection algorithms are proposed to distinguish anomalies from heavy traffic. However, most of them based on data mining or machine learning methods, which brings unexpected computational cost and high false alarm rates. In this paper, we propose a simple distance-computing algorithm for detection, is able normal traffic using but effective mechanism. Experimental results the well-known KDD Cup 1999 dataset demonstrate it can effectively detect with true positives, low positives acceptable cost.

参考文章(15)
Eleazar Eskin, Andrew Arnold, Michael Prerau, Leonid Portnoy, Sal Stolfo, A Geometric Framework for Unsupervised Anomaly Detection Applications of Data Mining in Computer Security. pp. 77- 101 ,(2002) , 10.1007/978-1-4615-0953-0_4
E Eskin, Andrew Arnold, Michael Prerau, Leonid Portnoy, Sal Stolfo, A GEOMETRIC FRAMEWORK FOR UNSUPERVISED ANOMALY DETECTION: DETECTING INTRUSIONS IN UNLABELED DATA APPLICATIONS OF DATA MINING IN COMPUTER SECURITY. pp. 0- 0 ,(2002) , 10.7916/D8D50TQT
Wenke Lee, Salvatore J. Stolfo, Data mining approaches for intrusion detection usenix security symposium. pp. 6- 6 ,(1998) , 10.21236/ADA401496
Kostas Proedrou, Ilia Nouretdinov, Volodya Vovk, Alex Gammerman, Transductive Confidence Machines for Pattern Recognition Lecture Notes in Computer Science. pp. 381- 390 ,(2002) , 10.1007/3-540-36755-1_32
Liwei Kuang, Mohammad Zulkernine, An anomaly intrusion detection method using the CSI-KNN algorithm Proceedings of the 2008 ACM symposium on Applied computing - SAC '08. pp. 921- 926 ,(2008) , 10.1145/1363686.1363897