Deluge based Genetic Algorithm for feature selection

被引:61
作者
Guha, Ritam [1 ]
Ghosh, Manosij [1 ]
Kapri, Souvik [1 ]
Shaw, Sushant [1 ]
Mutsuddi, Shyok [1 ]
Bhateja, Vikrant [2 ]
Sarkar, Ram [1 ]
机构
[1] Jadavpur Univ, Comp Sci & Engn Dept, 188 Raja SC Mallick Rd, Kolkata 700032, W Bengal, India
[2] Shri Ramswaroop Mem Grp Profess Coll, Elect & Commun Engn Dept, Lucknow 226028, Uttar Pradesh, India
关键词
Feature selection; Deluge based Genetic Algorithm; Genetic Algorithm; Great deluge algorithm; Metaheuristic; Local search; UCI dataset; OPTIMIZATION;
D O I
10.1007/s12065-019-00218-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection methods are used to identify and remove irrelevant and redundant attributes from the original feature vector that do not have much contribution to enhance the performance of a predictive model. Meta-heuristic feature selection algorithms, used as a solution to this problem, need to have a good trade-off between exploitation and exploration of the search space. Genetic Algorithm (GA), a popular meta-heuristic algorithm, lacks exploitation capability, which in turn affects the local search ability of the algorithm. Basically, GA uses mutation operation to take care of exploitation which has certain limitations. As a result, GA gets stuck in local optima. To encounter this problem, in the present work, we have intelligently blended the Great Deluge Algorithm (GDA), a local search algorithm, with GA. Here GDA is used in place of mutation operation of the GA. Application of GDA yields a high degree of exploitation through the use of perturbation of candidate solutions. The proposed method is named as Deluge based Genetic Algorithm (DGA). We have applied the DGA on 15 publicly available standard datasets taken from the UCI dataset repository. To show the classifier independent nature of the proposed feature selection method, we have used 3 different classifiers namely K-Nearest Neighbour (KNN), Multi-layer Perceptron (MLP) and Support Vector Machine (SVM). Comparison of DGA has been performed with other contemporary algorithms like the basic version of GA, Particle Swarm Optimisation (PSO), Simulated Annealing (SA) and Histogram based Multi-Objective GA (HMOGA). From the comparison results, it has been observed that DGA performs much better than others in most of the cases. Thus, our main contributions in this paper are introduction of a new variant of GA for FS which uses GDA to strengthen its exploitational ability and application of the proposed method on 15 well-known UCI datasets using KNN, MLP and SVM classifiers.
引用
收藏
页码:357 / 367
页数:11
相关论文
共 34 条
[1]  
Ablavsky V, 2003, PROC INT CONF DOC, P750
[2]  
[Anonymous], 2010, Ant colony optimization
[3]  
Badawi UA, 2013, HYBRID MEMETIC ALGOR, V10, P348
[4]  
Basu S., 2005, P 2 NAT C COMP PROC, P285
[5]   Design optimization with chaos embedded great deluge algorithm [J].
Baykasoglu, Adil .
APPLIED SOFT COMPUTING, 2012, 12 (03) :1055-1067
[6]  
Belli S, 2007, ATHENEA DIGIT, P104
[7]   Script Identification using Gabor Feature and SVM Classifier [J].
Chaudhari, Shailesh ;
Gulati, Ravi M. .
PROCEEDINGS OF INTERNATIONAL CONFERENCE ON COMMUNICATION, COMPUTING AND VIRTUALIZATION (ICCCV) 2016, 2016, 79 :85-92
[8]  
Culberson Jc, 1996, 9618 TR U ALB DEP CO
[9]  
De Jong K. A., 1992, Annals of Mathematics and Artificial Intelligence, V5, P1, DOI 10.1007/BF01530777
[10]   NEW OPTIMIZATION HEURISTICS - THE GREAT DELUGE ALGORITHM AND THE RECORD-TO-RECORD TRAVEL [J].
DUECK, G .
JOURNAL OF COMPUTATIONAL PHYSICS, 1993, 104 (01) :86-92