Reduction of data size in intrusion domain using modified simulated annealing fuzzy clustering algorithm

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

Abstract

Network security is becoming an important issue as the size and application of the network is exponentially increasing worldwide. Performance of Intrusion Detection System (IDS) is greatly depends on the size of data and a systematic approach to handling such data. In the paper, modified simulated annealing fuzzy clustering (SAFC) algorithm has been proposed using the concept of Rough set theory that removes randomness of the SAFC algorithm and applied on intrusion domain for data size reduction. The reduced data set increases classification accuracy in detecting network data set as 'anomaly' or 'normal' compared to the original data set. Davies-Bouldin (DB) validity Index is evaluated to measure the performance of the proposed IDS. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Sengupta, N., Srivastava, A., & Sil, J. (2013). Reduction of data size in intrusion domain using modified simulated annealing fuzzy clustering algorithm. In Communications in Computer and Information Science (Vol. 296 CCIS, pp. 97–102). Springer Verlag. https://doi.org/10.1007/978-3-642-35864-7_14

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