Title: A feature selection method based on neighbourhood rough set and genetic algorithm for intrusion detection

Authors: Min Ren; Zhihao Wang; Peiying Zhao

Addresses: School of Mathematics and Quantitative Economics, Shandong University of Finance and Economics, Jinan, Shandong Province, China ' School of Management and Engineering, Shandong University of Finance and Economics, Jinan, Shandong Province, China ' School of Mathematics and Quantitative Economics, Shandong University of Finance and Economics, Jinan, Shandong Province, China

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.

Keywords: rough set; neighbourhood relation; genetic algorithm; feature selection; attribute reduction.

DOI: 10.1504/IJICS.2022.125245

International Journal of Information and Computer Security, 2022 Vol.18 No.3/4, pp.278 - 299

Received: 02 Dec 2019
Accepted: 20 Feb 2020
Published online: 05 Sep 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article