Attribute selection using binary flower pollination algorithm with greedy crossover and 'one to all' initialisation. Issue 21 (1st October 2016)

• Record Type: Journal Article
• Authors: Preethi, C.M.; Vanathi, P.T.
• Is Part Of: Electronics letters. Volume 52:Issue 21(2016)
• Page Start: 1757
• Page End: 1759
• Publication Date: 2016-10-01
• Subjects: support vector machines -- optimisation -- pattern classification -- greedy algorithms; attribute selection -- binary flower pollination algorithm -- greedy crossover -- wrapper‐based methodology -- BFPA -- support vector machine -- pre‐mature convergence -- UCI repository -- metaheuristic algorithms; Electronics -- Periodicals; 621.381
• DOI: 10.1049/el.2016.2324
• Languages: English
• ISSNs: 0013-5194

Abstract

Abstract : 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.