A feature selection method based on neighbourhood rough set and genetic algorithm for intrusion detection Online publication date: Mon, 05-Sep-2022
by Min Ren; Zhihao Wang; Peiying Zhao
International Journal of Information and Computer Security (IJICS), Vol. 18, No. 3/4, 2022
Abstract: In intrusion detection system, unsupervised clustering algorithm is often used to analyse the detected data without class labels, and judge them as the normal or abnormal behaviour. Optimal feature subset can cut down the computational time of the clustering algorithm and effectively improve the intelligibility and accuracy of the clustering result. Therefore, this paper put forward a feature selection algorithm based on neighbourhood rough set and genetic algorithm. Firstly, neighbourhood rough set model, expanding the equivalence relation of discrete space to that of continuous space, was improved from class average distance of decision attributes and attribute significance two aspects. Then, genetic algorithm was used to select optimal feature subset based on improved attribute significance. Finally, in order to verify the feasibility, experiments were done on KDD CUP 99, and the results showed that the feature subset selected by the proposed algorithm ensured FCM getting higher accuracy.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook