Algorithm for clustering with intrusion detection using modified and hashed K - Means algorithms

14Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The k-Means clustering algorithm partition a dataset into meaningful patterns. Intrusion Detection System detects malicious attacks which generally include theft information. It can be found from the studies that clustering based intrusion detection methods may be helpful in detecting unknown attack patterns compared to traditional intrusion detection systems. This paper presents modified k-Means by applying preprocessing and normalization steps. As a result the effectiveness is improved and it overcomes the shortcomings of k-Means. This approach is proposed to work on network intrusion data and the algorithm is experimented with KDD99 dataset and found satisfactory results. © 2012 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Rao, M. V., Damodaram, A., & Charyulu, N. C. B. (2012). Algorithm for clustering with intrusion detection using modified and hashed K - Means algorithms. In Advances in Intelligent and Soft Computing (Vol. 167 AISC, pp. 737–744). https://doi.org/10.1007/978-3-642-30111-7_70

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