Hashed-K-means: A proposed intrusion detection algorithm

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

Abstract

Intrusion Detection Systems detect the malicious attacks which generally include theft of information or data. It is found from the studies that clustering based intrusion detection methods may be helpful in detecting unknown attack patterns compared to traditional intrusion detection systems. In this paper a new clustering algorithm is proposed to work on network intrusion data. The algorithm is experimented with KDD99 dataset and found satisfactory results. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Borah, S., Chetry, S. P. K., & Singh, P. K. (2011). Hashed-K-means: A proposed intrusion detection algorithm. In Communications in Computer and Information Science (Vol. 250 CCIS, pp. 855–860). https://doi.org/10.1007/978-3-642-25734-6_153

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