access icon free Attribute selection using binary flower pollination algorithm with greedy crossover and ‘one to all’ initialisation

Wrapper-based methodology for attribute selection is achieved by employing ‘support vector machine (SVM)’ and ‘binary flower pollination algorithm (BFPA)’. A greedy crossover is proposed to reset the suboptimal solution obtained on pre-mature convergence. Also, ‘one to all’ initialisation is developed to devise the initial pollen population for diversified exploration. The proposed methodologies are validated with datasets from uc irvine (UCI) repository and results show superior performance on comparison with the literature on both ‘BFPA’ and other metaheuristic algorithms for attribute selection.

Inspec keywords: optimisation; greedy algorithms; support vector machines; pattern classification

Other keywords: metaheuristic algorithms; greedy crossover; binary flower pollination algorithm; attribute selection; BFPA; wrapper-based methodology; UCI repository; pre-mature convergence; support vector machine

Subjects: Optimisation techniques; Knowledge engineering techniques; Data handling techniques

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
      • 5. Zawbaa, H.M., Hassanien, A.E., Emary, E., Yamany, W., Parv, B.: ‘Hybrid flower pollination algorithm with rough sets for feature selection’. Int. Computer Engineering Conf., Egypt, 29 December 2015, pp. 278283, doi: 10.1109/icenco.2015.7416362.
    5. 5)
    6. 6)
      • 4. Rodrigues, D., Yang, X.S., De Souza, A.N., Papa, J.P.: ‘Binary flower pollination algorithm and its application to feature selection’, in Yang, X.-S. (Ed.): Recent advances in swarm intelligence and evolutionary computation, (Springer International Publishing, Switzerland, 2014), pp. 85100, doi: 10.1007/978-3-319-13826-8_5.
    7. 7)
    8. 8)
      • 2. Asuncion, A., Newman, D.: ‘UCI machine learning repository’. Available at http://www.archives.ics.uci.edu/ml/, accessed May 2016.
    9. 9)
      • 12. Nakamura, R.Y., Pereira, L.A., Costa, K.A., Rodrigues, D., Papa, J.P., Yang, X.S.: ‘BBA: a binary bat algorithm for feature selection’. SIBGRAPI Conf. on Graphics, Patterns and Images, Ouro Preto, Minas Gerais, Brazil, August 2012, pp. 291297, doi: 10.1109/sibgrapi.2012.47.
    10. 10)
      • 1. Yang, X.S.: ‘Nature-inspired metaheuristic algorithms’ (Luniver Press, 2010).
    11. 11)
      • 11. Rodrigues, D., Pereira, L., Almeida, T., et al: ‘BCS: A binary cuckoo search algorithm for feature selection’. Proc. IEEE Int. Symp. on Circuits and Systems, Beijing, China, September 2013, pp. 465468, doi: 10.1109/iscas.2013.6571881.
    12. 12)
    13. 13)
    14. 14)
      • 13. He, X., Zhang, Q., Sun, N., Dong, Y.: ‘Feature selection with discrete binary differential evolution’. Int. Conf. in Artificial Intelligence and Computational Intelligence, Shanghai, China, November 2009, vol. 4, pp. 327330, doi: 10.1109/aici.2009.438.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2016.2324
Loading

Related content

content/journals/10.1049/el.2016.2324
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading