A Modified Ant Lion Optimization Method and Its Application for Instance Reduction Problem in Balanced and Imbalanced Data

Abstract

Instance reduction is a pre-processing step devised to improve the task of classification. Instance reduction algorithms search for a reduced set of instances to mitigate the low computational efficiency and high storage requirements. Hence, finding the optimal subset of instances is of utmost importance. Metaheuristic techniques are used to search for the optimal subset of instances as a potential application. Antlion optimization (ALO) is a recent metaheuristic algorithm that simulates antlion's foraging performance in finding and attacking ants. However, the ALO algorithm suffers from local optima stagnation and slow convergence speed for some optimization problems. In this study, a new modified antlion optimization (MALO) algorithm is recommended to improve the primary ALO performance by adding a new parameter that depends on the step length of each ant while revising the antlion position. Furthermore, the suggested MALO algorithm is adapted to the challenge of instance reduction to obtain better results in terms of many metrics. The results based on twenty-three benchmark functions at 500 iterations and thirteen benchmark functions at 1000 iterations demonstrate that the proposed MALO algorithm escapes the local optima and provides a better convergence rate as compared to the basic ALO algorithm and some well-known and recent optimization algorithms. In addition, the results based on 15 balanced and imbalanced datasets and 18 oversampled imbalanced datasets show that the instance reduction proposed method can statistically outperform the basic ALO algorithm and has strong competitiveness against other comparative algorithms in terms of four performance measures: Accuracy, Balanced Accuracy (BACC), Geometric mean (G-mean), and Area Under the Curve (AUC) in addition to the run time. MALO algorithm results show increment in Accuracy, BACC, G-mean, and AUC rates up to 7%, 3%, 15%, and 9%, respectively, for some datasets over the basic ALO algorithm while keeping less computational time.