quick reduct
Recently Published Documents


TOTAL DOCUMENTS

17
(FIVE YEARS 5)

H-INDEX

5
(FIVE YEARS 1)

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.


Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 58
Author(s):  
Alessio Ferone ◽  
Antonio Maratea

Data streams are ubiquitous and related to the proliferation of low-cost mobile devices, sensors, wireless networks and the Internet of Things. While it is well known that complex phenomena are not stationary and exhibit a concept drift when observed for a sufficiently long time, relatively few studies have addressed the related problem of feature drift. In this paper, a variation of the QuickReduct algorithm suitable to process data streams is proposed and tested: it builds an evolving reduct that dynamically selects the relevant features in the stream, removing the redundant ones and adding the newly relevant ones as soon as they become such. Tests on five publicly available datasets with an artificially injected drift have confirmed the effectiveness of the proposed method.


Author(s):  
Alessio Ferone ◽  
Tsvetozar Georgiev ◽  
Antonio Maratea
Keyword(s):  

Author(s):  
S. Vijaya Rani ◽  
G. N. K Suresh Babu

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.


2016 ◽  
Vol 28 (10) ◽  
pp. 2995-3008 ◽  
Author(s):  
Jothi Ganesan ◽  
Hannah H. Inbarani ◽  
Ahmad Taher Azar ◽  
Kemal Polat

Sign in / Sign up

Export Citation Format

Share Document