Feature Selection Based on Improved Runner-Root Algorithm Using Chaotic Singer Map and Opposition-Based Learning

  • Rehab Ali Ibrahim
  • Diego Oliva
  • Ahmed A. Ewees
  • Songfeng LuEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10638)


The feature selection (FS) is an important step for data analysis. FS is used to reduce the dimension of data by selecting the relevant features; while removing the redundant, noisy and irrelevant features that lead to degradation of the performance. Several swarm techniques are used to solve the FS problem and these methods provide results better than classical approaches. However, most of these techniques have limitations such as slow convergence and time complexity. These limitations occur due that all the agents update their position according to the best one. However, this best agent may be not the optimal global solution for FS, therefore, the swarm getting stuck in a local solution. This paper proposes an improved Runner-Root Algorithm (RRA). The RRA is combined with chaotic Singer map and opposition-based learning to increase its accuracy. The experiments are performed in eight datasets and the performance of the proposed method is compared against swarm algorithms.


Feature selection (FS) Opposition-based learning (OBL) Metaheuristic algorithms (MH) Chaotic map Runner-Root Algorithm (RRA) Swarm intelligence (SI) 



This work are supported by the Natural Science Foundation of Hubei Province of China under Grant No. 2016CFB541 and the Applied Basic Research Program of Wuhan Science and Technology Bureau of China under Grant No. 2016010101010003 and the Science and Technology Program of Shenzhen of China under Grant No. JCYJ20170307160458368.


  1. 1.
    Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157–1182 (2003)zbMATHGoogle Scholar
  2. 2.
    Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufman, San Francisco (2000)zbMATHGoogle Scholar
  3. 3.
    Awada, W., Khoshgoftaar, T.M., Dittman, D., Wald, R., Napolitano, A.: A Review of the stability of feature selection techniques for bioinformatics data. In: 2012 IEEE 13th International Conference on Information Reuse Integration (IRI), pp. 356–363 (2012)Google Scholar
  4. 4.
    Chang, P., Lin, J., Liu, C.: An attribute weight assignment and particle swarm optimization algorithm for medical database classifications. Comput. Methods Prog. Biomed. 107(3), 382–392 (2012)CrossRefGoogle Scholar
  5. 5.
    El Aziz, M.A., Hassanien, A.E.: An improved social spider optimization algorithm based on rough sets for solving minimum number attribute reduction problem. Neural Comput. Appl. (2017)Google Scholar
  6. 6.
    Guyon, I., Weston, J., Barnhill, S., Vapnik, V.: Gene selection for cancer classification using support vector machines. J. Mach. Learn. Res. 46, 389–422 (2002)CrossRefzbMATHGoogle Scholar
  7. 7.
    Sivagaminathan, R.K., Ramakrishnan, S.: A hybrid approach for feature subset selection using neural networks and antcolony optimization. Expert Syst. Appl. 33, 49–60 (2007)CrossRefGoogle Scholar
  8. 8.
    Zhu, Z.X., Ong, Y.S., Dash, M.: Wrapper-filter feature selection algorithm using a memetic framework. IEEE Trans. Cybern. Part B: Cybern. 37(1), 70–76 (2007)CrossRefGoogle Scholar
  9. 9.
    Suguna, N., Thanushkodi, K.: An independent rough set approach hybrid with artificial bee colony algorithm for dimensionality reduction. Am. J. Appl. Sci. 8(3), 261–266 (2011)CrossRefGoogle Scholar
  10. 10.
    El Aziz, M.A., Hassanien, A.E.: Modified cuckoo search algorithm with rough sets for feature selection. Neural Comput. Appl. 1–10 (2016)Google Scholar
  11. 11.
    Inbarani, H.H., Azar, A.T., Jothi, G.: Supervised hybrid feature selection based on PSO and rough sets for medical diagnosis. Comput. Methods Prog. Biomed. 113, 175–185 (2014)CrossRefGoogle Scholar
  12. 12.
    Tizhoosh, H.R.: Opposition-based learning: a new scheme for machine intelligence. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, vol. 1, pp. 695–701 (2005)Google Scholar
  13. 13.
    Cuevas, E., Oliva, D., Zaldivar, D., Perez-Cisneros, M., Pajares, G., Prez-Cisneros, M., Pajares, G.: Opposition-based electromagnetism-like for global optimization. Int. J. Innov. Comput. Inf. Control 8, 8181–8198 (2012)Google Scholar
  14. 14.
    Merrikh-Bayat, F.: The runner-root algorithm: a metaheuristic for solving unimodal and multimodal optimization problems inspired by runners and roots of plants in nature. Appl. Soft Comput. 33, 292–303 (2015)CrossRefGoogle Scholar
  15. 15.
    Chuang, L.-Y., Yang, C.-H., Li, J.-C.: Chaotic maps based on binary particle swarm optimization for feature selection. Appl. Soft Comput. 11(1), 239–248 (2011)CrossRefGoogle Scholar
  16. 16.
    Wang, X., Yang, J., Teng, X., Xia, W., Jensen, R.: Feature selection based on rough sets and particle swarm optimization. Pattern Recog. Lett. 28(4), 459–471 (2007)CrossRefGoogle Scholar
  17. 17.
    Asuncion, A., Newman, D.H.: UCI machine learning repository. School of Information and Computer Sciences, University of California, Irvine (2010).
  18. 18.
    Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks 1995, vol. 4, pp. 1942–1948. IEEE Press (1995)Google Scholar
  19. 19.
    Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Appl. Math. Comput. 188(2), 1567–1579 (2007)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Rehab Ali Ibrahim
    • 1
  • Diego Oliva
    • 2
  • Ahmed A. Ewees
    • 3
  • Songfeng Lu
    • 1
    • 4
    Email author
  1. 1.School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanChina
  2. 2.Departamento de Ciencias ComputacionalesUniversidad de GuadalajaraGuadalajaraMexico
  3. 3.Department of ComputerDamietta UniversityDamiettaEgypt
  4. 4.Shenzhen Research InstituteHuazhong University of Science and TechnologyShenzhenChina

Personalised recommendations