Open AccessAttribute selection using binary flower pollination algorithm with greedy crossover and ‘one to all’ initialisation
Author(s) -
Preethi C.M.,
Vanathi P.T.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2016.2324
Subject(s) - crossover , selection (genetic algorithm) , greedy algorithm , binary number , support vector machine , convergence (economics) , reset (finance) , algorithm , computer science , population , metaheuristic , mathematical optimization , mathematics , artificial intelligence , demography , arithmetic , sociology , financial economics , economics , economic growth
Wrapper‐based methodology for attribute selection is achieved by employing ‘support vector machine (SVM)’ and ‘binary flower pollination algorithm (BFPA)’. A greedy crossover is proposed to reset the suboptimal solution obtained on pre‐mature convergence. Also, ‘one to all’ initialisation is developed to devise the initial pollen population for diversified exploration. The proposed methodologies are validated with datasets from uc irvine (UCI) repository and results show superior performance on comparison with the literature on both ‘BFPA’ and other metaheuristic algorithms for attribute selection.