Intrusion Detection Using Back Propagation Neural Network and Quick Reduct Algorithms

2018 ◽  
pp. 317-325
Author(s):  
S. Vijaya Rani ◽  
G. N. K Suresh Babu
Keyword(s):  
Feature Selection ◽  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Detection System ◽  
Back Propagation ◽  
Back Propagation Neural Network ◽  
Data Sets ◽  
Effective Technique ◽  
Data Set ◽  
Quick Reduct

It is a big challenge to safeguard a network and data due to various network threats and attacks in a network system. Intrusion detection system is an effective technique to negotiate the issues of network security by utilizing various network classifiers. It detects malicious attacks. The data sets available in the study of intrusion detection system were DARPA, KDD 1999 cup, NSL_KDD, DEFCON, ISCX-UNB, KDD 1999 cup data set is the best and old data set for research purpose on intrusion detection. The data is preprocessed, normalized and trained by BPN algorithm. Further the normalized data is discretized using Entropy discretization and feature selection carried out by quick reduct methods. After feature selection, the concerned feature from normalized data is processed through BPN for better accuracy and efficiency of the system.

scholarly journals An Analysis of the KDD99 and UNSW-NB15 Datasets for the Intrusion Detection System

Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1666
Author(s):  
Muataz Salam Al-Daweri ◽  
Khairul Akram Zainol Ariffin ◽  
Salwani Abdullah ◽  
Mohamad Firham Efendy Md. Senan
Keyword(s):  
Feature Selection ◽  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Rough Set Theory ◽  
Technology Development ◽  
Detection System ◽  
Selection Process ◽  
Back Propagation ◽  
Back Propagation Neural Network ◽  
Selection Of

The significant increase in technology development over the internet makes network security a crucial issue. An intrusion detection system (IDS) shall be introduced to protect the networks from various attacks. Even with the increased amount of works in the IDS research, there is a lack of studies that analyze the available IDS datasets. Therefore, this study presents a comprehensive analysis of the relevance of the features in the KDD99 and UNSW-NB15 datasets. Three methods were employed: a rough-set theory (RST), a back-propagation neural network (BPNN), and a discrete variant of the cuttlefish algorithm (D-CFA). First, the dependency ratio between the features and the classes was calculated, using the RST. Second, each feature in the datasets became an input for the BPNN, to measure their ability for a classification task concerning each class. Third, a feature-selection process was carried out over multiple runs, to indicate the frequency of the selection of each feature. From the result, it indicated that some features in the KDD99 dataset could be used to achieve a classification accuracy above 84%. Moreover, a few features in both datasets were found to give a high contribution to increasing the classification’s performance. These features were present in a combination of features that resulted in high accuracy; the features were also frequently selected during the feature selection process. The findings of this study are anticipated to help the cybersecurity academics in creating a lightweight and accurate IDS model with a smaller number of features for the developing technologies.

Coal Mine Disaster Warning Internet of Things Intrusion Detection System Based on Back Propagation Neural Network Improved by Genetic Algorithms

2013 ◽  
Vol 441 ◽  
pp. 343-346 ◽  
Author(s):  
Ying Hu ◽  
Li Min Sun ◽  
Sheng Chen Yu ◽  
Jiang Lan Huang ◽  
Xiao Ju Wang ◽  
...  
Keyword(s):  
Neural Network ◽  
Genetic Algorithms ◽  
Internet Of Things ◽  
Coal Mine ◽  
Intrusion Detection System ◽  
Detection System ◽  
Back Propagation ◽  
Back Propagation Neural Network ◽  
Threshold Values ◽  
Data Set

In order to improve the detection rate of intruders in coal mine disaster warning internet of things, and to solve the problem that the back propagate neural network (BPNN) is invalid when these initial weight and threshold values of BPNN are chosen impertinently, Genetic Algorithms (GA) s characteristic of getting whole optimization value was combined with BPNNs characteristic of getting local precision value with gradient method. After getting an approximation of whole optimization value of weight and threshold values of BPNN by GA, the approximation was used as first parameter of BPNN, to train (educate) the BPNN again (in other words, learning). The educated BPNN was used to recognize intruders in internet of things. Experiment results shown that this method was useful and applicable, and the detection right rate of intruders was above 95% for the KDD CUP 1999 data set.

scholarly journals A novel ensemble modeling for intrusion detection system

2020 ◽  
Vol 10 (2) ◽  
pp. 1963
Author(s):  
Pullagura Indira Priyadarsini ◽  
G. Anuradha
Keyword(s):  
Feature Selection ◽  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Nearest Neighbor ◽  
Detection System ◽  
Distance Functions ◽  
Classification Model ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Data Set

Vast increase in data through internet services has made computer systems more vulnerable and difficult to protect from malicious attacks. Intrusion detection systems (IDSs) must be more potent in monitoring intrusions. Therefore an effectual Intrusion Detection system architecture is built which employs a facile classification model and generates low false alarm rates and high accuracy. Noticeably, IDS endure enormous amounts of data traffic that contain redundant and irrelevant features, which affect the performance of the IDS negatively. Despite good feature selection approaches leads to a reduction of unrelated and redundant features and attain better classification accuracy in IDS. This paper proposes a novel ensemble model for IDS based on two algorithms Fuzzy Ensemble Feature selection (FEFS) and Fusion of Multiple Classifier (FMC). FEFS is a unification of five feature scores. These scores are obtained by using feature-class distance functions. Aggregation is done using fuzzy union operation. On the other hand, the FMC is the fusion of three classifiers. It works based on Ensemble decisive function. Experiments were made on KDD cup 99 data set have shown that our proposed system works superior to well-known methods such as Support Vector Machines (SVMs), K-Nearest Neighbor (KNN) and Artificial Neural Networks (ANNs). Our examinations ensured clearly the prominence of using ensemble methodology for modeling IDSs. And hence our system is robust and efficient.

Sign in / Sign up

Export Citation Format

Share Document