Iterative Per Group Feature Selection For Intrusion Detection

Network security is an critical subject in any distributed network. Recently, machine learning has proven their efficiency for intrusion detection. By using a comprehensive dataset with multiple attack types, a well-trained model can be created to improve the anomaly detection performance. However, high dimensional data sets are a significant challenge for machine learning. In fact, learning algorithms considering all features in the input data, may cause over-fitting to irrelevant aspects of the data and increase the computational time caused by the process of similar features that provide redundant information, which is a critical problem especially for users with constrained resources. In this paper, we propose a new and efficient feature selection technique for intrusion detection in modern networks called Iterative Per Group Feature Selection (IPGFS). IPGFS reduces the number of features in the input data and selects the best features using the performance accuracy of the classifier. The features are sorted and selected according to their accuracy score. Both the UNSW and NSLKDD datasets are used in this paper to validate the proposed model and verify its efficiency in detecting intrusions. The simulation results show that the proposed model can reduce the number of features for the two dataset while successfully detecting intrusions with better accuracy compared to state-of-the-art techniques. Index Cloud security, feature selection, accuracy, machine learning techniques.