Skip to main content

Feature Selection for High-Dimensional Data Based on a Multi-objective Particle Swarm Optimization with Self-adjusting Strategy Pool

  • Conference paper
  • First Online:
Neural Computing for Advanced Applications (NCAA 2022)

Abstract

The development of data collection increases the dimensionality of the data in many fields, which might even cause the curse of dimensionality, arising a challenge to many existing feature selection. This paper proposes a method based on a feature prioritization approach and a multi-objective particle swarm optimization with self-adjusting strategy pool (MOPSO-SaSP). The proposed algorithm adopts a backward filter approach based on Approximate Markov blankets as a pre-processing step which prioritizes features into predominant features and subordinate features to reduce the search space and lessen the randomness of the initialization step. Afterwards, an adaptive mechanism is applied that enables each particle to adaptively choose a strategy from the strategy pool according to the latest information collected. The strategy pool is constructed through a series of experiments on training data. Different strategies specialized in different searching methods. Experimental results on eight benchmark micro-array gene datasets reveal that the feature prioritization approach can deal features in an efficient way and the adaptive mechanism is a powerful searching method to achieve a competitive classification accuracy and reduce the number of features.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Xue, B., Zhang, M., Browne, W.N., Yao, X.: A survey on evolutionary computation approaches to feature selection. IEEE Trans. Evol. Comput. 20(4), 606–626 (2016)

    Article  Google Scholar 

  2. Kira, K., Rendell, L.A.: The feature selection problem: traditional methods and a new algorithm. In: Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 129–134 (1992)

    Google Scholar 

  3. Zhao, X., Liu, Z.: Hybrid particle swarm optimization with differential and perturbation. J. Front. Comput. Sci. Technol. 8(2), 218 (2014)

    Google Scholar 

  4. Nguyen, H.B., Xue, B., Zhang, M.: A subset similarity guided method for multi-objective feature selection. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS (LNAI), vol. 9592, pp. 298–310. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-28270-1_25

    Chapter  Google Scholar 

  5. Xue, B., Cervante, L., Shang, L., Borowne, W.N., Zhang, M.J.: Multi-objective evolutionary algorithms for filter based feature selection in classification. Int. J. Artif. Intell. Tools 22(4), 1–34 (2013)

    Article  Google Scholar 

  6. Chuang, L.-Y., Chang, H.-W., Tu, C.-J., Yang, C.-H.: Improved binary PSO for feature selection using gene expression data. Comput. Biol. Chem. 32(1), 29–38 (2008). https://doi.org/10.1016/j.compbiolchem.2007.09.005

    Article  MATH  Google Scholar 

  7. Xue, B., Zhang, M., Browne, W.N.: Particle swarm optimization for feature selection in classification: a multi-objective approach. IEEE Trans. Cybern. 43(6), 1656–1671 (2013). https://doi.org/10.1109/TSMCB.2012.27469

    Article  Google Scholar 

  8. Zhou, Y., Kang, J., Guo, H.: Many-objective optimization of feature selection based on two-level particle cooperation. Inf. Sci. 532, 91–109 (2020). https://doi.org/10.1016/j.ins.202

    Article  MathSciNet  Google Scholar 

  9. Zhou, Y., Kang, J., Kwong, S., Wang, X., Zhang, Q.: An evolutionary multi-objective optimization framework of discretization-based feature selection for classification. Swarm Evol. Comput. 60, 100770 (2021). https://doi.org/10.1016/j.swevo.20. ISSN 2210-6502

  10. Rani, C., Kothari, D.P.: Dynamic economic emission dispatch problem with valve-point effect. In: International Conference on Emerging Trends in Electrical Engineering and Energy Management. IEEE (2013)

    Google Scholar 

  11. Xue, Y., Xue, B., Zhang, M.: Self-adaptive particle swarm optimization for large-scale feature selection in classification. ACM Trans. Knowl. Discov. Data 13(5), 27. Article 50 (2019). https://doi.org/10.1145/3340848

  12. Yu, L., Liu, H.: Efficient feature selection via analysis of relvance and redundancy. J. Mach. Learn. Res. 5(12), 1205–1224 (2004)

    MATH  Google Scholar 

  13. Quinlan, J.R.: Discovering rules by induction from large collections of examples. Expert Syst. Micro Electron. Age (1979)

    Google Scholar 

  14. Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C. Cambridge University Press, Cambridge (1988)

    MATH  Google Scholar 

  15. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings IEEE International Conference Neural Networks, vol. 4. pp. 1942–1948 (1995)

    Google Scholar 

  16. Wang, Y., Li, B., Weise, T., Wang, J.Y., Yuan, B., Tian, Q.J.: Self-adaptive learning based particle swarm optimization. Inf. Sci. 181(20), 4515–4538 (2011)

    Article  MathSciNet  Google Scholar 

  17. Wang, H., Sun, H., Li, C.H., Rahnamayan, S., Pan, J.S.: Diversity enhanced particle swarm optimization with neighborhood search. Inf. Sci. 223(2013), 119–135 (2013)

    Article  MathSciNet  Google Scholar 

  18. Li, X.: A non-dominated sorting particle swarm optimizer for multiobjective optimization. In: Proceedings Annual GECCO, pp. 37–48 (2003)

    Google Scholar 

  19. Tran, B., Xue, B., Zhang, M.: A new representation in PSO for discretization-based feature selection. IEEE Trans. Cybern. 48(6), 1733–1746 (2018). https://doi.org/10.1109/TCYB.2017.2714145

    Article  Google Scholar 

  20. Cheng, S., Shi, Y., Qin, Q.: Population diversity of particle swarm optimizer solving single and multi-objective problems. Int. J. Swarm Intell. Res. 3(4), 23–60 (2012)

    Article  Google Scholar 

  21. Tran, B., Xue, B., Zhang, M.: Variable-length particle swarm optimisation for feature selection on high-dimensional classification. IEEE Trans. Evol. Comput. 23(3), 473–487 (2018). https://doi.org/10.1109/TEVC.2018.2869405.1-1

    Article  Google Scholar 

  22. Mohamad, M.S., Omatu, S., Deris, S., Yoshioka, M.: A modified binary particle swarm optimization for selecting the small subset of informative genes from gene expression data. IEEE Trans. Inf. Technol. Biomed. 15(6), 813–822 (2011)

    Article  Google Scholar 

  23. Zhou, Y., Zhang, W., Kang, J., Zhang, X., Wang, X.: A problem-specific non-dominated sorting genetic algorithm for supervised feature selection. Inf. Sci. 547, 841–859 (2021). ISSN 0020-0255

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dandan Yu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Peng, Y., Wang, R., Yu, D., Zhou, Y. (2022). Feature Selection for High-Dimensional Data Based on a Multi-objective Particle Swarm Optimization with Self-adjusting Strategy Pool. In: Zhang, H., et al. Neural Computing for Advanced Applications. NCAA 2022. Communications in Computer and Information Science, vol 1637. Springer, Singapore. https://doi.org/10.1007/978-981-19-6142-7_39

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-6142-7_39

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-6141-0

  • Online ISBN: 978-981-19-6142-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics