Experimental study of variation local search mechanism for bee algorithm feature selection

The bees algorithm (ba) has been applied for finding the best possible subset features of a dataset. however,the main issue of the ba for feature selection is that it requires long computational time. this is due to the nature of ba combination search approach that exploits neighborhoods with random explorative. this situation creates unwanted sub-optimum solution(s) leading to the lack of accuracy and longer processing time. a set of different local neighborhood search extension and their combination approaches have been proposed,including simple-swap,2-opt,3-opt,and 4-opt. the performance of the proposed mechanism was compared and analyzed using benchmark dataset. the results from experimental work confirmed that the proposed approach provides better accuracy with suitable time.