scholarly journals Research on the Precision Instrument Reliability and Anti-interference Mode from the Intrusion Detection Angle based on Rough Set

Author(s):  
Jinping Tan ◽  
Renqing Li
Author(s):  
Neha Gupta ◽  
Ritu Prasad ◽  
Praneet Saurabh ◽  
Bhupendra Verma

Author(s):  
Tarum Bhaskar ◽  
Narasimha Kamath B.

Intrusion detection system (IDS) is now becoming an integral part of the network security infrastructure. Data mining tools are widely used for developing an IDS. However, this requires an ability to find the mapping from the input space to the output space with the help of available data. Rough sets and neural networks are the best known data mining tools to analyze data and help solve this problem. This chapter proposes a novel hybrid method to integrate rough set theory, genetic algorithm (GA), and artificial neural network. Our method consists of two stages: First, rough set theory is applied to find the reduced dataset. Second, the results are used as inputs for the neural network, where a GA-based learning approach is used to train the intrusion detection system. The method is characterized not only by using attribute reduction as a pre-processing technique of an artificial neural network but also by an improved learning algorithm. The effectiveness of the proposed method is demonstrated on the KDD cup data.


2013 ◽  
Vol 416-417 ◽  
pp. 1399-1403 ◽  
Author(s):  
Zhi Cai Shi ◽  
Yong Xiang Xia ◽  
Chao Gang Yu ◽  
Jin Zu Zhou

The discretization is one of the most important steps for the application of Rough set theory. In this paper, we analyzed the shortcomings of the current relative works. Then we proposed a novel discretization algorithm based on information loss and gave its mathematical description. This algorithm used information loss as the measure so as to reduce the loss of the information entropy during discretizating. The algorithm was applied to different samples with the same attributes from KDDcup99 and intrusion detection systems. The experimental results show that this algorithm is sensitive to the samples only for parts of all attributes. But it dose not compromise the effect of intrusion detection and it improves the response performance of intrusion detection remarkably.


2016 ◽  
Vol 66 (6) ◽  
pp. 612 ◽  
Author(s):  
M.R. Gauthama Raman ◽  
K. Kannan ◽  
S.K. Pal ◽  
V. S. Shankar Sriram

Immense growth in network-based services had resulted in the upsurge of internet users, security threats and cyber-attacks. Intrusion detection systems (IDSs) have become an essential component of any network architecture, in order to secure an IT infrastructure from the malicious activities of the intruders. An efficient IDS should be able to detect, identify and track the malicious attempts made by the intruders. With many IDSs available in the literature, the most common challenge due to voluminous network traffic patterns is the curse of dimensionality. This scenario emphasizes the importance of feature selection algorithm, which can identify the relevant features and ignore the rest without any information loss. In this paper, a novel rough set κ-Helly property technique (RSKHT) feature selection algorithm had been proposed to identify the key features for network IDSs. Experiments carried using benchmark KDD cup 1999 dataset were found to be promising, when compared with the existing feature selection algorithms with respect to reduct size, classifier’s performance and time complexity. RSKHT was found to be computationally attractive and flexible for massive datasets.


Author(s):  
NIKITA GUPTA ◽  
NARENDER SINGH ◽  
VIJAY SHARMA ◽  
TARUN SHARMA ◽  
AMAN SINGH BHANDARI

With the expansion of computer network there is a challenge to compete with the intruders who can easily break into the system. So it becomes a necessity to device systems or algorithms that can not only detect intrusion but can also improve the detection rate. In this paper we propose an intrusion detection system that uses rough set theory for feature selection, which is extraction of relevant attributes from the entire set of attributes describing a data packet and used the same theory to classify the packet if it is normal or an attack. After the simplification of the discernibility matrix we were to select or reduce the features. We have used Rosetta tool to obtain the reducts and classification rules. NSL KDD dataset is used as training set and is provided to Rosetta to obtain the classification rules.


Sign in / Sign up

Export Citation Format

Share Document