The DOI matches its Crossref record.
Binary particle swarm optimisation for feature selection: A filter based approach
Open accessAbstract
Based on binary particle swarm optimisation (BPSO) and information theory, this paper proposes two new filter feature selection methods for classification problems. The first algorithm is based on BPSO and the mutual information of each pair of features, which determines the relevance and redundancy of the selected feature subset. The second algorithm is based on BPSO and the entropy of each group of features, which evaluates the relevance and redundancy of the selected feature subset. Different weights for the relevance and redundancy in the fitness functions of the two proposed algorithms are used to further improve their performance in terms of the number of features and the classification accuracy. In the experiments, a decision tree (DT) is employed to evaluate the classification accuracy of the selected feature subset on the test sets of four datasets. The results show that with proper weights, two proposed algorithms can significantly reduce the number of features and achieve similar or even higher classification accuracy in almost all cases. The first algorithm usually selects a smaller feature subset while the second algorithm can achieve higher classification accuracy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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-citationParticle swarm optimization for feature selection in classification: a multi-objective approach
Xue, B., Zhang, M., & Browne, W. N. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2227469 · Cited by 1,282
Self-citationDifferential 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
Self-citationEnhanced whale optimization algorithm for medical feature selection: A COVID-19 case study
Nadimi-Shahraki, M. H., Zamani, H., & Mirjalili, S. (2022) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2022.105858 · Cited by 316
Elmasry, W., Akbulut, A., & Zaim, A. H. (2020) · Computer Networks · doi:10.1016/j.comnet.2019.107042 · Cited by 277
Metadata
- Authors
- Cervante, L., Xue, B., Zhang, M., & Shang, L.
- Venue
- 2012 IEEE Congress on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2012-06
- Pages
- 1-8
- OpenAlex
- W2153004548
- Cited by
- 172
- References
- 0
- FWCI
- 5.91
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Binary particle swarm optimisation for feature selection: A filter based approach. https://app.cochat.ai/papers/10.1109/cec.2012.6256452
- The paper
- Cervante, L., Xue, B., Zhang, M., & Shang, L. (2012). Binary particle swarm optimisation for feature selection: A filter based approach. 2012 IEEE Congress on Evolutionary Computation. https://doi.org/10.1109/cec.2012.6256452
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.