Feature selection using bare-bones particle swarm optimization with mutual information
The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Abstract
Abstract Feature selection (FS) is an important data processing method in pattern recognition and data mining. Due to not considering characteristics of the FS problem itself, traditional particle update mechanisms and swarm initialization strategies adopted in most particle swarm optimization (PSO) limit their performance on dealing with high-dimensional FS problems. Focused on it, this paper proposes a novel feature selection algorithm based on bare bones PSO (BBPSO) with mutual information. Firstly, an effective swarm initialization strategy based on label correlation is developed, making full use of the correlation between features and class labels to accelerate the convergence of swarm. Then, in order to enhance the exploitation performance of the algorithm, two local search operators, i.e., the supplementary operator and the deletion operator, are developed based on feature relevance-redundancy. Furthermore, an adaptive flip mutation operator is designed to help particles jump out of local optimal solutions. We apply the proposed algorithm to typical datasets based on the K-Nearest Neighbor classifier (K-NN), and compare it with eleven state-of-the-art algorithms, SFS, PTA, SGA, BPSO, PSO(4-2), HPSO-LS, Binary BPSO, NaFA, IBFA, KPLS-mRMR and SMBA-CSFS. The experimental results show that the proposed algorithm can achieve a feature subset with better performance, and is a highly competitive FS algorithm.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
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
Selection bias in gene extraction on the basis of microarray gene-expression data
Ambroise, C., & McLachlan, G. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.102102699 · Cited by 1,480
Comparison of algorithms that select features for pattern classifiers
Kudo, M., & Sklansky, J. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00041-2 · Cited by 905
Kennedy, J. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202251 · Cited by 690
Xue, B., Zhang, M., & Browne, W. N. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2013.09.018 · Cited by 614
Wrapper–Filter Feature Selection Algorithm Using a Memetic Framework
Zhu, Z., Ong, Y.-S., & Dash, M. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.883267 · Cited by 443
Jain, I., Jain, V. K., & Jain, R. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.09.038 · Cited by 423
Differential evolution for filter feature selection based on information theory and feature ranking
Hancer, E., Xue, B., & Zhang, M. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.10.028 · Cited by 394
Moradi, P., & Gholampour, M. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.01.044 · Cited by 372
A hybrid approach of differential evolution and artificial bee colony for feature selection
Zorarpacı, E., & Özel, S. A. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.06.004 · Cited by 371
Genetic programming for simultaneous feature selection and classifier design
Muni, D. P., Pal, N. R., & Das, J. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.854499 · Cited by 357
A hybrid feature selection algorithm for gene expression data classification
Lu, H., Chen, J., Yan, K., Jin, Q., Xue, Y., & Gao, Z. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.07.080 · Cited by 354
Self-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification
Xue, Y., Xue, B., & Zhang, M. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3340848 · Cited by 342
Pareto front feature selection based on artificial bee colony optimization
Hancer, E., Xue, B., Zhang, M., Karaboga, D., & Akay, B. (2018) · Information Sciences · doi:10.1016/j.ins.2017.09.028 · Cited by 325
Unler, A., Murat, A., & Chinnam, R. B. (2011) · Information Sciences · doi:10.1016/j.ins.2010.05.037 · Cited by 319
Firefly algorithm with neighborhood attraction
Wang, H., Wang, W., Zhou, X., Sun, H., Zhao, J., Yu, X., & Cui, Z. (2017) · Information Sciences · doi:10.1016/j.ins.2016.12.024 · Cited by 315
A new local search based hybrid genetic algorithm for feature selection
Kabir, M. M., Shahjahan, M., & Murase, K. (2011) · Neurocomputing · doi:10.1016/j.neucom.2011.03.034 · Cited by 264
Hybrid particle swarm optimization with spiral-shaped mechanism for feature selection
Chen, K., Zhou, F.-Y., & Yuan, X.-F. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.03.039 · Cited by 204
A New Representation in PSO for Discretization-Based Feature Selection
Tran, B., Xue, B., & Zhang, M. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2714145 · Cited by 203
A two-stage gene selection scheme utilizing MRMR filter and GA wrapper
El Akadi, A., Amine, A., El Ouardighi, A., & Aboutajdine, D. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-010-0288-x · Cited by 168
A novel feature selection method based on normalized mutual information
Vinh, L. T., Lee, S., Park, Y.-T., & d’Auriol, B. J. (2011) · Applied Intelligence · doi:10.1007/s10489-011-0315-y · Cited by 156
A PSO-based multi-objective multi-label feature selection method in classification
Zhang, Y., Gong, D., Sun, X., & Guo, Y. (2017) · Scientific Reports · doi:10.1038/s41598-017-00416-0 · Cited by 131
Self-citationGallego, A., Calvo-Zaragoza, J., Valero-Mas, J. J., & Rico-Juan, J. R. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.09.038 · Cited by 127
Zhang, L., & Suganthan, P. N. (2017) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2017.2742867 · Cited by 124
A ranking-based feature selection approach for handwritten character recognition
Cilia, N. D., Stefano, C. D., Fontanella, F., & di Freca, A. S. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2018.04.007 · Cited by 124
Simultaneous feature selection and discretization based on mutual information
Sharmin, S., Shoyaib, M., Ali, A. A., Khan, M. A. H., & Chae, O. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.02.016 · Cited by 124
A new maximum relevance-minimum multicollinearity (MRmMC) method for feature selection and ranking
Senawi, A., Wei, H., & Billings, S. A. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.01.026 · Cited by 120
A Study of Collapse in Bare Bones Particle Swarm Optimization
Blackwell, T. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2136347 · Cited by 116
Zhang, X., Zhang, Q., Chen, M., Sun, Y., Qin, X., & Li, H. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.11.016 · Cited by 104
Moslehi, F., & Haeri, A. (2019) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-019-01364-5 · Cited by 104
Two-Step Particle Swarm Optimization to Solve the Feature Selection Problem
Bello, R., Gómez, Y., Nowé, A., & Garcia, M. (2007) · International Conference on Intelligent Systems Design and Applications (ISDA) · doi:10.1109/isda.2007.101 · Cited by 99
Graph Regularized Feature Selection with Data Reconstruction
Zhao, Z., He, X., Cai, D., Zhang, L., Ng, W., & Zhuang, Y. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2493537 · Cited by 85
Gene selection and classification using Taguchi chaotic binary particle swarm optimization
Chuang, L., Yang, C., Wu, K., & Yang, C. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.04.165 · Cited by 75
Adaptive bare-bones particle swarm optimization algorithm and its convergence analysis
Zhang, Y., Gong, D., Sun, X., & Geng, N. (2013) · Soft Computing · doi:10.1007/s00500-013-1147-y · Cited by 66
Self-citationA PSO based hybrid feature selection algorithm for high-dimensional classification
Tran, B., Zhang, M., & Xue, B. (2016) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2016.7744271 · Cited by 65
Tran, B., Xue, B., Zhang, M., & Nguyen, S. (2016) · Connection Science · doi:10.1080/09540091.2016.1185392 · Cited by 58
Gangavarapu, T., & Patil, N. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.105538 · Cited by 57
On feature selection protocols for very low-sample-size data
Kuncheva, L. I., & Rodríguez, J. J. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.03.012 · Cited by 48
A Kernel Partial least square based feature selection method
Talukdar, U., Hazarika, S. M., & Gan, J. Q. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.05.012 · Cited by 47
Supervised feature selection by self-paced learning regression
Gan, J., Wen, G., Yu, H., Zheng, W., & Lei, C. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2018.08.029 · Cited by 41
Zhang, J., Gao, B., Chai, H., Ma, Z., & Yang, G. (2016) · BMC Bioinformatics · doi:10.1186/s12859-016-1201-8 · Cited by 35
A permutational-based Differential Evolution algorithm for feature subset selection
Rivera-López, R., Mezura‐Montes, E., Canul-Reich, J., & Cruz‐Chávez, M. A. (2020) · Pattern Recognition Letters · doi:10.1016/j.patrec.2020.02.021 · Cited by 30
A Sparse-Modeling Based Approach for Class Specific Feature Selection
Nardone, D., Ciaramella, A., & Staiano, A. (2019) · PeerJ Computer Science · doi:10.7717/peerj-cs.237 · Cited by 28
A hybrid feature selection method for data sets of thousands of variables
Liu, J., & Wang, G. (2010) · International Conference on Advanced Computer Control · doi:10.1109/icacc.2010.5486671 · Cited by 25
Discriminative embedded unsupervised feature selection
Zhu, Q.-H., & Yang, Y.-B. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2018.07.018 · Cited by 20
Cited by
A comprehensive survey on recent metaheuristics for feature selection
Dokeroglu, T., Deniz, A., & Kiziloz, H. E. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.04.083 · Cited by 356
Song, X.-F., Zhang, Y., Gong, D.-W., & Gao, X.-Z. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3061152 · Cited by 348
Self-citationBaker, S., & Xiang, W. (2023) · arXiv · doi:10.48550/arxiv.2312.01555 · Cited by 12
A Two-Layer Network Intrusion Detection Method Incorporating LSTM and Stacking Ensemble Learning
Wang, J., Ge, C., Li, Y., Zhao, H., Fu, Q., Cao, K., & Jung, H. (2025) · Computers, Materials & Continua · doi:10.32604/cmc.2025.062094 · Cited by 8
Metadata
- Authors
- Song, X.-F., Zhang, Y., Gong, D.-W., & Sun, X.-Y.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2021-04
- Volume
- 112
- Pages
- 107804
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W3117495151
- Cited by
- 266
- References
- 48
- FWCI
- 12.60
- 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.