Rough Set-hypergraph-based Feature Selection Approach for Intrusion Detection Systems
Keywords: Intrusion detection systems, rough set theory, hyper graph, feature selection, ?-Helly property
AbstractImmense growth in network-based services had resulted in the upsurge of internet users, security threats and cyber-attacks. Intrusion detection systems (IDSs) have become an essential component of any network architecture, in order to secure an IT infrastructure from the malicious activities of the intruders. An efficient IDS should be able to detect, identify and track the malicious attempts made by the intruders. With many IDSs available in the literature, the most common challenge due to voluminous network traffic patterns is the curse of dimensionality. This scenario emphasizes the importance of feature selection algorithm, which can identify the relevant features and ignore the rest without any information loss. In this paper, a novel rough set κ-Helly property technique (RSKHT) feature selection algorithm had been proposed to identify the key features for network IDSs. Experiments carried using benchmark KDD cup 1999 dataset were found to be promising, when compared with the existing feature selection algorithms with respect to reduct size, classifier’s performance and time complexity. RSKHT was found to be computationally attractive and flexible for massive datasets.
How to Cite
Raman, M., Kannan, K., Pal, S., & Sriram, V. S. (2016). Rough Set-hypergraph-based Feature Selection Approach for Intrusion Detection Systems. Defence Science Journal, 66(6), 612-617. https://doi.org/10.14429/dsj.66.10802
Special Issue Papers
Copyright (c) 2016 Defence Science Journal
Where otherwise noted, the Articles on this site are licensed under Creative Commons License: CC Attribution-Noncommercial-No Derivative Works 2.5 India