Efficient Feature Selection Algorithm Based on Population Random Search with Adaptive Memory Strategies
The effectiveness of classifier training methods depends significantly on the number of features that describe a dataset to be classified. This research proposes a new approach to feature selection that combines random and heuristic search strategies. A solution is represented as a binary vector whose size is determined by the number of features in a dataset. New solutions are generated randomly using normal and uniform distributions. The heuristic underlying the proposed approach is formulated as follows: the chance for a feature to be included into the next generation is proportional to the frequency of its occurrence in the previous best solutions. For feature selection, we have used the algorithm with a fuzzy classifier. The method is tested on several datasets from the KEEL repository. Comparison with analogs is presented. To compare feature selection algorithms, we found the values their efficiency criterion. This criterion reflects the accuracy of the classification and the speed of finding the appropriate features.
KeywordsFeature selection Classification Population random search Adaptive memory strategies
This work was supported by the Russian Foundation for Basic Research, project no. 16-07-00034.
- 1.Aggarwal, C.C.: An introduction to data classification. In: Data Classification: Algorithms and Applications, pp. 2–36. CRC Press, New York (2015)Google Scholar
- 11.Gurav, A., Nair, V., Gupta U., Valadi, J.: Glowworm swarm based informative attribute selection using support vector machines for simultaneous feature selection and classification. In: Panigrahi, B.K., et al. (eds.) SEMCCO 2014. LNCS, vol. 8947, pp. 27–37. Springer, Heidelberg (2015)CrossRefGoogle Scholar
- 13.Glover, F., Laguna, M.: Tabu Search. Springer (1997)Google Scholar
- 15.Hedar, A., Abdel-Hakim, A.E., Almaraashi, M.: Granular-based dimension reduction for solar radiation prediction using adaptive memory programming. In: GECCO 2016 Companion Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, pp. 929–936. ACM, New York (2016)Google Scholar
- 17.Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on System, Man, and Cybernetics, vol 5, pp. 4104–4108 (1997)Google Scholar
- 18.Pereria, L.A.M, Rodrigues, D., Almedia, T.N.S., Ramos, C.C.O., Souza, A.N., Yang, X.-S., Papa, J.P.: A binary Cuckoo search and its application for feature selection. In: Cuckoo Search and Firefly Algorithm. Studies in Computational Intelligence, vol. 516, pp. 141–154. Springer, London (2014)Google Scholar