z-logo
open-access-imgOpen Access
An Efficient Intrusion Detection System with Custom Features using FPA-Gradient Boost Machine Learning Algorithm
Author(s) -
D.V. Jeyanthi,
B. Indrani
Publication year - 2022
Publication title -
international journal of computer networks and communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.159
H-Index - 8
eISSN - 0975-2293
pISSN - 0974-9322
DOI - 10.5121/ijcnc.2022.14107
Subject(s) - computer science , intrusion detection system , gradient boosting , artificial intelligence , machine learning , classifier (uml) , algorithm , word error rate , redundancy (engineering) , random forest , operating system
An efficient Intrusion Detection System has to be given high priority while connecting systems with a network to prevent the system before an attack happens. It is a big challenge to the network security group to prevent the system from a variable types of new attacks as technology is growing in parallel. In this paper, an efficient model to detect Intrusion is proposed to predict attacks with high accuracy and less false-negative rate by deriving custom features UNSW-CF by using the benchmark intrusion dataset UNSW-NB15. To reduce the learning complexity, Custom Features are derived and then Significant Features are constructed by applying meta-heuristic FPA (Flower Pollination algorithm) and MRMR (Minimal Redundancy and Maximum Redundancy) which reduces learning time and also increases prediction accuracy. ENC (ElasicNet Classifier), KRRC (Kernel Ridge Regression Classifier), IGBC (Improved Gradient Boosting Classifier) is employed to classify the attacks in the datasets UNSW-CF, UNSW and recorded that UNSW-CF with derived custom features using IGBC integrated with FPA provided high accuracy of 97.38% and a low error rate of 2.16%. Also, the sensitivity and specificity rate for IGB attains a high rate of 97.32% and 97.50% respectively.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here