The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Particle swarm optimisation for feature selection in classification: Novel initialisation and updating mechanisms
Abstract
In classification, feature selection is an important data pre-processing technique, but it is a difficult problem due mainly to the large search space. Particle swarm optimisation (PSO) is an efficient evolutionary computation technique. However, the traditional personal best and global best updating mechanism in PSO limits its performance for feature selection and the potential of PSO for feature selection has not been fully investigated. This paper proposes three new initialisation strategies and three new personal best and global best updating mechanisms in PSO to develop novel feature selection approaches with the goals of maximising the classification performance, minimising the number of features and reducing the computational time. The proposed initialisation strategies and updating mechanisms are compared with the traditional initialisation and the traditional updating mechanism. Meanwhile, the most promising initialisation strategy and updating mechanism are combined to form a new approach (PSO(4-2)) to address feature selection problems and it is compared with two traditional feature selection methods and two PSO based methods. Experiments on twenty benchmark datasets show that PSO with the new initialisation strategies and/or the new updating mechanisms can automatically evolve a feature subset with a smaller number of features and higher classification performance than using all features. PSO(4-2) outperforms the two traditional methods and two PSO based algorithm in terms of the computational time, the number of features and the classification performance. The superior performance of this algorithm is due mainly to both the proposed initialisation strategy, which aims to take the advantages of both the forward selection and backward selection to decrease the number of features and the computational time, and the new updating mechanism, which can overcome the limitations of traditional updating mechanisms by taking the number of features into account, which reduces the number of features and the computational time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
Cited by
Feature selection in machine learning: A new perspective
Cai, J., Luo, J., Wang, S., & Yang, S. (2018) · Neurocomputing · doi:10.1016/j.neucom.2017.11.077 · Cited by 2,061
A Survey on Evolutionary Computation Approaches to Feature Selection
Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504420 · Cited by 1,841
Self-citationWhale optimization approaches for wrapper feature selection
Mafarja, M., & Mirjalili, S. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.11.006 · Cited by 825
Greylag Goose Optimization: Nature-inspired optimization algorithm
El-kenawy, E.-S. M., Khodadadi, N., Mirjalili, S., Abdelhamid, A. A., Eid, M. M., & Ibrahim, A. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122147 · Cited by 586
A Survey on semi-supervised feature selection methods
Sheikhpour, R., Sarram, M. A., Gharaghani, S., & Chahooki, M. A. Z. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2016.11.003 · Cited by 505
Binary ant lion approaches for feature selection
Emary, E., Zawbaa, H. M., & Hassanien, A. E. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.03.101 · Cited by 483
Review of swarm intelligence-based feature selection methods
Rostami, M., Berahmand, K., Nasiri, E., & Forouzandeh, S. (2021) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2021.104210 · Cited by 451
A novel chaotic salp swarm algorithm for global optimization and feature selection
Sayed, G. I., Khoriba, G., & Haggag, M. H. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1158-6 · Cited by 411
A survey on swarm intelligence approaches to feature selection in data mining
Nguyen, B. H., Xue, B., & Zhang, M. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100663 · Cited by 403
Self-citationBinary grasshopper optimisation algorithm approaches for feature selection problems
Mafarja, M., Aljarah, I., Faris, H., Hammouri, A. I., Al-Zoubi, A. M., & Mirjalili, S. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.09.015 · Cited by 397
Moradi, P., & Gholampour, M. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.01.044 · Cited by 372
Feature selection for high-dimensional classification using a competitive swarm optimizer
Gu, S., Cheng, R., & Jin, Y. (2018) · Soft Computing · doi:10.1007/s00500-016-2385-6 · Cited by 360
Variable-Length Particle Swarm Optimization for Feature Selection on High-Dimensional Classification
Tran, B., Xue, B., & Zhang, M. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869405 · Cited by 333
Self-citationA new fusion of grey wolf optimizer algorithm with a two-phase mutation for feature selection
Abdel-Basset, M., El-Shahat, D., El-henawy, I., de Albuquerque, V. H. C., & Mirjalili, S. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112824 · Cited by 333
A comparative review on sleep stage classification methods in patients and healthy individuals
Boostani, R., Karimzadeh, F., & Nami, M. (2017) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2016.12.004 · Cited by 316
Feature selection using bare-bones particle swarm optimization with mutual information
Song, X.-F., Zhang, Y., Gong, D.-W., & Sun, X.-Y. (2021) · Pattern Recognition · doi:10.1016/j.patcog.2020.107804 · Cited by 266
An Evolutionary Multitasking-Based Feature Selection Method for High-Dimensional Classification
Chen, K., Xue, B., Zhang, M., & Zhou, F. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3042243 · Cited by 263
Self-citationA multiple combined method for rebalancing medical data with class imbalances
Wang, Y.-C., & Cheng, C.-H. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2021.104527 · Cited by 66
Metadata
- Authors
- Xue, B., Zhang, M., & Browne, W. N.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2014-05
- Volume
- 18
- Pages
- 261-276
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W1543715688
- Cited by
- 614
- References
- 49
- FWCI
- 29.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.