A surrogate-assisted GA enabling high-throughput ML by optimal feature and discretization selection

作者: Johan Garcia

DOI: 10.1145/3377929.3398092

关键词:

摘要: Novel lookup-based classification approaches allow machine-learning (ML) to be performed at extremely high rates for suitable low-dimensional problems. A central aspect of such is the crucial importance placed on optimal selection features and discretized feature representations. In this work we propose study a hybrid-genetic algorithm (hGAm) approach solve optimization problem. For considered problem fitness evaluation function expensive, as it entails training ML classifier with proposed set representations, then evaluating resulting classifier. We have here devised surrogate by casting representation combinatorial in form multiple-choice quadratic knapsack (MCQKP). The orders magnitude faster allows comprehensive hGAm performance performed. results show that trade-off exists around 5000 evaluations, also provide characterization parameter behaviors input future extensions.

参考文章(31)
M. E. Dyer, An O( n ) algorithm for the multiple-choice knapsack linear program Mathematical Programming. ,vol. 29, pp. 57- 63 ,(1984) , 10.1007/BF02591729
Tugba Saraç, Aydin Sipahioglu, Generalized quadratic multiple knapsack problem and two solution approaches Computers & Operations Research. ,vol. 43, pp. 78- 89 ,(2014) , 10.1016/J.COR.2013.08.018
Md. Monirul Kabir, Md. Shahjahan, Kazuyuki Murase, A new local search based hybrid genetic algorithm for feature selection Neurocomputing. ,vol. 74, pp. 2914- 2928 ,(2011) , 10.1016/J.NEUCOM.2011.03.034
Lucas Létocart, Marie-Christine Plateau, Gérard Plateau, An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem Pesquisa Operacional. ,vol. 34, pp. 49- 72 ,(2014) , 10.1590/S0101-74382014000100005
Yi-Leh Wu, Cheng-Yuan Tang, Maw-Kae Hor, Pei-Fen Wu, Feature selection using genetic algorithm and cluster validation Expert Systems With Applications. ,vol. 38, pp. 2727- 2732 ,(2011) , 10.1016/J.ESWA.2010.08.062
Alain Billionnet, Frédéric Calmels, Linear programming for the 0–1 quadratic knapsack problem European Journal of Operational Research. ,vol. 92, pp. 310- 325 ,(1996) , 10.1016/0377-2217(94)00229-0
Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut, Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem Computers & Operations Research. ,vol. 39, pp. 32- 41 ,(2012) , 10.1016/J.COR.2010.12.016
Fred Glover, Haibo Wang, Gary Kochenberger, A computational study on the quadratic knapsack problem with multiple constraints Computers & Operations Research. ,vol. 39, pp. 3- 11 ,(2012) , 10.1016/J.COR.2010.12.017
Chih-Fong Tsai, William Eberle, Chi-Yuan Chu, Genetic algorithms in feature and instance selection Knowledge Based Systems. ,vol. 39, pp. 240- 247 ,(2013) , 10.1016/J.KNOSYS.2012.11.005
David Pisinger, The quadratic knapsack problem-a survey Discrete Applied Mathematics. ,vol. 155, pp. 623- 648 ,(2007) , 10.1016/J.DAM.2006.08.007