Fast feature selection algorithm for neighborhood rough set model based on Bucket and Trie structures

2019 ◽  
Vol 5 (3) ◽  
pp. 329-347 ◽  
Author(s):  
Rachid Benouini ◽  
Imad Batioua ◽  
Soufiane Ezghari ◽  
Khalid Zenkouar ◽  
Azeddine Zahi
Complexity ◽  
2014 ◽  
Vol 20 (5) ◽  
pp. 50-62 ◽  
Author(s):  
Mohammad Taghi Rezvan ◽  
Ali Zeinal Hamadani ◽  
Seyed Reza Hejazi

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.


2019 ◽  
Vol 497 ◽  
pp. 77-90 ◽  
Author(s):  
K Selvakumar ◽  
Marimuthu Karuppiah ◽  
L SaiRamesh ◽  
SK Hafizul Islam ◽  
Mohammad Mehedi Hassan ◽  
...  

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 704
Author(s):  
Jiucheng Xu ◽  
Kanglin Qu ◽  
Meng Yuan ◽  
Jie Yang

Feature selection is one of the core contents of rough set theory and application. Since the reduction ability and classification performance of many feature selection algorithms based on rough set theory and its extensions are not ideal, this paper proposes a feature selection algorithm that combines the information theory view and algebraic view in the neighborhood decision system. First, the neighborhood relationship in the neighborhood rough set model is used to retain the classification information of continuous data, to study some uncertainty measures of neighborhood information entropy. Second, to fully reflect the decision ability and classification performance of the neighborhood system, the neighborhood credibility and neighborhood coverage are defined and introduced into the neighborhood joint entropy. Third, a feature selection algorithm based on neighborhood joint entropy is designed, which improves the disadvantage that most feature selection algorithms only consider information theory definition or algebraic definition. Finally, experiments and statistical analyses on nine data sets prove that the algorithm can effectively select the optimal feature subset, and the selection result can maintain or improve the classification performance of the data set.


Author(s):  
Haixia Lu ◽  
Jinsong Yuan

It is a hot issue to be widely studied to determine the factors affecting students' performance from the perspective of data mining. In order to find the key factors that significantly affect students' performance from complex data, this paper pro-poses an integrated Optimized Ensemble Feature Selection Algorithm by Density Peaks (DPEFS). This algorithm is applied to the education data collected by two high schools in China, and the selected discriminative features are used to con-struct a student performance prediction model based on support vector machine (SVM). The results of the 10-fold cross-validation experiment show that, com-pared with various feature selection algorithms such as mRMR, Relief, SVM-RFE and AVC, the SVM student performance prediction model based on the fea-ture selection algorithm proposed in this paper has better prediction performance. In addition, some factors and rules affecting student performance can be extracted from the discriminative features selected by the feature selection algorithm in this paper, which provides a methodological and technical reference for teachers, edu-cation management staffs and schools to predict and analyze the students’ per-formances.


Sign in / Sign up

Export Citation Format

Share Document