Hybrid Rough Set with Black Hole Optimization Based Feature Selection Algorithm for Protein Structure Prediction

Author(s):  
M. Bagyamathi ◽  
Ahmad Taher Azar ◽  
H. Hannah Inbarani

In this paper, a new approach for hybridizing Rough Set Quick Reduct and Relative Reduct approaches with Black Hole optimization algorithm is proposed. This algorithm is inspired of black holes. A black hole is a region of spacetime where the gravitational field is so strong that nothing— not even light— that enters this region can ever escape from it. Every black hole has a mass and charge. In this Algorithm, each solution of problem is considered as a black hole and gravity force is used for global search and the electrical force is used for local search. The proposed algorithm is compared with leading algorithms such as, Rough Set Quick Reduct, Rough Set Relative Reduct, Rough Set particle swarm optimization based Quick Reduct, Rough Set based PSO Relative Reduct, Rough Set Harmony Search based Quick Reduct, and Rough Set Harmony Search based Relative Reduct.


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 5 (3) ◽  
pp. 329-347 ◽  
Author(s):  
Rachid Benouini ◽  
Imad Batioua ◽  
Soufiane Ezghari ◽  
Khalid Zenkouar ◽  
Azeddine Zahi

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.


2007 ◽  
Vol 6 (2) ◽  
pp. 186-196 ◽  
Author(s):  
Ken-Li Lin ◽  
Chun-Yuan Lin ◽  
Chuen-Der Huang ◽  
Hsiu-Ming Chang ◽  
Chiao-Yun Yang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document