Skip to main content

Advertisement

Log in

A novel binary chaotic genetic algorithm for feature selection and its utility in affective computing and healthcare

  • S.I. : Healthcare Analytics
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Genetic algorithm (GA) is a nature-inspired algorithm to produce best possible solution by selecting the fittest individual from a pool of possible solutions. Like most of the optimization techniques, the GA can also stuck in the local optima, producing a suboptimal solution. This work presents a novel metaheuristic optimizer named as the binary chaotic genetic algorithm (BCGA) to improve the GA performance. The chaotic maps are applied to the initial population, and the reproduction operations follow. To demonstrate its utility, the proposed BCGA is applied to a feature selection task from an affective database, namely AMIGOS (A Dataset for Affect, Personality and Mood Research on Individuals and Groups) and two healthcare datasets having large feature space. Performance of the BCGA is compared with the traditional GA and two state-of-the-art feature selection methods. The comparison is made based on classification accuracy and the number of selected features. Experimental results suggest promising capability of BCGA to find the optimal subset of features that achieves better fitness values. The obtained results also suggest that the chaotic maps, especially sinusoidal chaotic map, perform better as compared to other maps in enhancing the performance of raw GA. The proposed approach obtains, on average, a fitness value twice as better than the one achieved through the raw GA in the identification of the seven classes of emotions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. https://archive.ics.uci.edu/.

  2. http://archive.ics.uci.edu/ml/datasets/Lung+Cancer.

  3. http://archive.ics.uci.edu/ml/datasets/Parkinson%27s+Disease+Classification.

References

  1. Ghareb AS, Bakar AA, Hamdan AR (2016) Hybrid feature selection based on enhanced genetic algorithm for text categorization. Expert Syst Appl 49:31–47

    Article  Google Scholar 

  2. Sayed GI, Hassanien AE, Azar AT (2019) Feature selection via a novel chaotic crow search algorithm. Neural Comput Appl 31(1):171–188

    Article  Google Scholar 

  3. El Aziz MA, Hassanien AE (2018) Modified cuckoo search algorithm with rough sets for feature selection. Neural Comput Appl 29(4):925–934

    Article  Google Scholar 

  4. Arora S, Anand P (2019) Chaotic grasshopper optimization algorithm for global optimization. Neural Comput Appl 31(8):4385–4405

    Article  Google Scholar 

  5. Uzma Halim Z (2020) Optimizing the DNA fragment assembly using metaheuristic-based overlap layout consensus approach. Appl Soft Comput 92:106256

    Article  Google Scholar 

  6. Iqbal S, Halim Z (2020) Orienting conflicted graph edges using genetic algorithms to discover pathways in protein–protein interaction networks. IEEE/ACM Trans Comput Biol Bioinf 1:1–26

    Google Scholar 

  7. Halim Z, Muhammad T (2017) Quantifying and optimizing visualization: an evolutionary computing-based approach. Inf Sci 385:284–313

    Article  Google Scholar 

  8. Oh IS, Lee JS, Moon BR (2004) Hybrid genetic algorithms for feature selection. IEEE Trans Pattern Anal Mach Intell 26(11):1424–1437

    Article  Google Scholar 

  9. Mafarja MM, Mirjalili S (2017) Hybrid whale optimization algorithm with simulated annealing for feature selection. Neurocomputing 260:302–312

    Article  Google Scholar 

  10. Zorarpacı E, Özel SA (2016) A hybrid approach of differential evolution and artificial bee colony for feature selection. Expert Syst Appl 62:91–103

    Article  Google Scholar 

  11. Halim Z, Ali O, Khan G (2020) On the efficient representation of datasets as graphs to mine maximal frequent itemsets. IEEE Trans Knowl Data Eng 1:1–18

    Google Scholar 

  12. Rodrigues D, Pereira LA, Almeida TNS, Papa JP, Souza AN, Ramos CC, Yang XS (2013) BCS: a binary cuckoo search algorithm for feature selection. In: IEEE international symposium on circuits and systems, pp 465–468

  13. Nakamura RY, Pereira LA, Costa KA, Rodrigues D, Papa JP, Yang XS (2012) BBA: a binary bat algorithm for feature selection. In: 25th SIBGRAPI conference on graphics, patterns and images, pp 291–297

  14. Bostani H, Sheikhan M (2017) Hybrid of binary gravitational search algorithm and mutual information for feature selection in intrusion detection systems. Soft Comput 21(9):2307–2324

    Article  Google Scholar 

  15. Tubishat M, Idris N, Shuib L, Abushariah MA, Mirjalili S (2020) Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection. Expert Syst Appl 145:113122

    Article  Google Scholar 

  16. Eroglu DY, Kilic K (2017) A novel hybrid genetic local search algorithm for feature selection and weighting with an application in strategic decision making in innovation management. Inf Sci 405:18–32

    Article  Google Scholar 

  17. Taradeh M, Mafarja M, Heidari AA, Faris H, Aljarah I, Mirjalili S, Fujita H (2019) An evolutionary gravitational search-based feature selection. Inf Sci 497:219–239

    Article  Google Scholar 

  18. Mafarja M, Eleyan D, Abdullah S, Mirjalili S (2017) S-shaped vs. V-shaped transfer functions for ant lion optimization algorithm in feature selection problem. In: Proceedings of the international conference on future networks and distributed systems, pp 1–7

  19. Altun H, Polat G (2009) Boosting selection of speech related features to improve performance of multi-class SVMs in emotion detection. Expert Syst Appl 36(4):8197–8203

    Article  Google Scholar 

  20. Ackermann P, Kohlschein C, Bitsch JÁ, Wehrle K, Jeschke S (2016) EEG-based automatic emotion recognition: feature extraction, selection and classification methods. In: IEEE 18th international conference on e-health networking, applications and services, pp 1–6

  21. Chatterjee A, Narahari KN, Joshi M, Agrawal P (2019) SemEval-2019 task 3: EmoContext contextual emotion detection in text. In: Proceedings of the 13th international workshop on semantic evaluation, pp 39–48

  22. Yan Y, Li C, Meng S (2019) Emotion recognition based on sparse learning feature selection method for social communication. SIViP 13(7):1253–1257

    Article  Google Scholar 

  23. Sundararajan K, Palanisamy A (2020) Multi-rule based ensemble feature selection model for sarcasm type detection in twitter. Comput Intell Neurosci 2020:1–17

    Article  Google Scholar 

  24. Al-Tashi Q, Rais H M, Abdulkadir SJ, Mirjalili S, Alhussian H (2020) A review of grey wolf optimizer-based feature selection methods for classification. In: Evolutionary machine learning techniques, pp 273–286

  25. Rehman S, Tu S, Waqas M, Rehman O, Ahmad B, Halim Z, Zhao W, Yang Z (2020) Optimization based training of evolutionary convolution neural network for visual classification applications. IET Comput Vis. https://doi.org/10.1049/iet-cvi.2019.0506

    Article  Google Scholar 

  26. Tavazoei MS, Haeri M (2007) Comparison of different one dimensional maps as chaotic search pattern in chaos optimization algorithms. Appl Math Comput 187:1076–1085

    MathSciNet  MATH  Google Scholar 

  27. Yang DX, Li G, Cheng GD (2007) On the efficiency of chaos optimization algorithms for global optimization. Chaos Solitons Fractals 34:1366–1375

    Article  MathSciNet  Google Scholar 

  28. Correa JAM, Abadi MK, Sebe N, Patras I (2020) Amigos: a dataset for affect, personality and mood research on individuals and groups. IEEE Trans Affect Comput 1:1–14

    Google Scholar 

  29. Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1:80–83

    Article  Google Scholar 

  30. Nakisa B, Rastgoo MN, Tjondronegoro D, Chandran V (2018) Evolutionary computation algorithms for feature selection of EEG-based emotion recognition using mobile sensors. Expert Syst Appl 93:143–155

    Article  Google Scholar 

  31. Razzak MI, Imran M, Xu G (2020) Big data analytics for preventive medicine. Neural Comput Appl 32:4417–4451

    Article  Google Scholar 

  32. Razzak I, Saris RA, Blumenstein M, Xu G (2020) Integrating joint feature selection into subspace learning: a formulation of 2DPCA for outliers robust feature selection. Neural Netw 121:441–451

    Article  Google Scholar 

  33. Razzak MI, Imran M, Xu G (2018) Efficient brain tumor segmentation with multiscale two-pathway-group conventional neural networks. IEEE J Biomed Health Inform 23(5):1911–1919

    Article  Google Scholar 

  34. Uzma Al-Obeidat F, Tubaishat A, Shah B, Halim Z (2020) Gene encoder: a feature selection technique through unsupervised deep learning-based clustering for large gene expression data. Neural Comput Appl. https://doi.org/10.1007/s00521-020-05101-4

    Article  Google Scholar 

  35. Halim Z, Uzma (2018) Optimizing the minimum spanning tree-based extracted clusters using evolution strategy. Clust Comput 21(1):377–391

    Article  Google Scholar 

  36. Halim Z, Atif M, Rashid A, Edwin CA (2019) Profiling players using real-world datasets: clustering the data and correlating the results with the big-five personality traits. IEEE Trans Affect Comput 10(4):568–584

    Article  Google Scholar 

  37. Naseer A, Rani M, Naz S, Razzak MI, Imran M, Xu G (2020) Refining Parkinson’s neurological disorder identification through deep transfer learning. Neural Comput Appl 32(3):839–854

    Article  Google Scholar 

  38. Razzak MI, Naz S, Zaib A (2018) Deep learning for medical image processing: overview, challenges and the future. Classif BioApps 26:323–350

    Article  Google Scholar 

  39. Rehman A, Naz S, Razzak MI, Akram F, Imran M (2020) A deep learning-based framework for automatic brain tumors classification using transfer learning. Circuits Syst Signal Process 39(2):757–775

    Article  Google Scholar 

  40. Shah A, Halim Z (2019) On efficient mining of frequent itemsets from big uncertain databases. J Grid Comput 17(4):831–850

    Article  Google Scholar 

Download references

Acknowledgements

The authors wish to thank GIK Institute for providing research facilities. This work was sponsored by the GIK Institute graduate research fund under GA4 scheme Grant Number GCS1737. The authors are indebted to the editor and anonymous reviewers for their helpful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Madiha Tahir.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tahir, M., Tubaishat, A., Al-Obeidat, F. et al. A novel binary chaotic genetic algorithm for feature selection and its utility in affective computing and healthcare. Neural Comput & Applic 34, 11453–11474 (2022). https://doi.org/10.1007/s00521-020-05347-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-020-05347-y

Keywords

Navigation