Improved clustering for intrusion detection by principal component analysis with effective noise reduction

12Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

PCA (Principal Component Analysis) is one of the most wildly used dimension reduction technique, which is often applied to identify patterns in complex data of high dimension [1]. In GA-KM [2], we have proposed GA-KM algorithm and have experimented using KDD-99 data set. The result showed GA-KM is efficient for intrusion detection. However, due to the hugeness of the data set, the experiment needs to take a long time to finish. To solve this deficiency, we combine PCA and GA-KM in this paper. The goal of PCA is to remove unimportant information like the noise in data sets which have high dimension, and retain the variation present in the original dataset as much as possible. The experimental results show that, compared to GA-KM [2], the proposed method is better in computational expense and time (through dimension reduction) and is also better in intrusion detection ratios (through noise reduction). © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhao, L., Kang, H. S., & Kim, S. R. (2013). Improved clustering for intrusion detection by principal component analysis with effective noise reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7804 LNCS, pp. 490–495). https://doi.org/10.1007/978-3-642-36818-9_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free