© The Institution of Engineering and Technology
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.
References
-
-
1)
-
8. Rodrigues, D., Pereira, L.A., Nakamura, R.Y., et al: ‘A wrapper approach for feature selection based on bat algorithm and optimum-path forest’, Expert Syst. Appl., 2014, 41, (5), pp. 2250–2258 (doi: 10.1016/j.eswa.2013.09.023).
-
2)
-
6. Tabakhi, S., Moradi, P.: ‘Relevance–redundancy feature selection based on ant colony optimization’, Pattern Recognit., 2015, 48, (9), pp. 2798–2811 (doi: 10.1016/j.patcog.2015.03.020).
-
3)
-
10. Unler, A., Murat, A., Chinnam, R.B.: ‘mr 2 PSO: a maximum relevance minimum redundancy feature selection method based on swarm intelligence for support vector machine classification’, Inf. Sci., 2011, 181, (20), pp. 4625–4641 (doi: 10.1016/j.ins.2010.05.037).
-
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. 278–283, .
-
5)
-
9. Xue, B., Zhang, M., Browne, W.N.: ‘Particle swarm optimization for feature selection in classification: a multi-objective approach’, Trans. Cybern., 2013, 43, (6), pp. 1656–1671 (doi: 10.1109/TSMCB.2012.2227469).
-
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. 85–100, .
-
7)
-
3. Sayed, S.A.F., Nabil, E., Badr, A.: ‘A binary clonal flower pollination algorithm for feature selection’, Pattern Recognit. Lett., 2016, 77, pp. 21–27 (doi: 10.1016/j.patrec.2016.03.014).
-
8)
-
2. Asuncion, A., Newman, D.: .
-
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. 291–297, .
-
10)
-
1. Yang, X.S.: ‘Nature-inspired metaheuristic algorithms’ (Luniver Press, 2010).
-
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. 465–468, .
-
12)
-
7. Emary, E., Zawbaa, H.M., Hassanien, A.E.: ‘Binary Grey Wolf optimization approaches for feature selection’, Neurocomputing, 2016, 172, pp. 371–381 (doi: 10.1016/j.neucom.2015.06.083).
-
13)
-
14. Moayedikia, A., Jensen, R., Wiil, U.K., Forsati, R.: ‘Weighted bee colony algorithm for discrete optimization problems with application to feature selection’, Eng. Appl. Artif. Intell., 2015, 44, pp. 153–167 (doi: 10.1016/j.engappai.2015.06.003).
-
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. 327–330, .
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2016.2324
Related content
content/journals/10.1049/el.2016.2324
pub_keyword,iet_inspecKeyword,pub_concept
6
6