References

EVALUATING K-MEANS++ CLUSTERING FOR ANOMALY-BASED INTRUSION DETECTION SYSTEMS-FOCUS ON EXTERNAL THREATS


[1] David Arthur and Sergei Vassilvitskii, k-means++: The advantages of careful seeding, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics, 2007.

[2] Damiano Bolzoni et al., Pancea: Automating attack classification for anomaly-based network intrusion detection systems, Recent Advances in Intrusion Detection (2009), 1-20.

[3] Yu Guan, Ali-Akbar Ghorbani and Nabil Belacel, Y-means: A clustering method for intrusion detection, 2003.

[4] Kingsly Leung and Christopher Leckie, Unsupervised anomaly detection in network intrusion detection using clusters, Proceedings of the Twenty-eighth Australasian conference on Computer Science, Volume 38, Australian Computer Society, Inc., 2005.

[5] Amuthan Prabakar Muniyandi, R. Rajeswari and R. Rajaram, Network anomaly detection by cascading k-means clustering and C4.5 decision tree algorithm, Procedia Engineering 30 (2012), 174-182.

[6] Al-Sakib Khan Pathan, Chapter 2 Network Traffic Monitoring and Analysis. The State of the Art in Intrusion Prevention and Detection, Boca Raton FL: CRC Press, 2014, 23-46.

[7] Steven L. Scott, A Bayesian paradigm for designing intrusion detection systems, Computational Statistics & Data Analysis 45(1) (2004), 69-83.

[8] Ali Shiravi et al., Toward developing a systematic approach to generate benchmark datasets for intrusion detection, Computers & Security 31(3) (2012), 357-374.