The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A New Representation in PSO for Discretization-Based Feature Selection
Abstract
In machine learning, discretization and feature selection (FS) are important techniques for preprocessing data to improve the performance of an algorithm on high-dimensional data. Since many FS methods require discrete data, a common practice is to apply discretization before FS. In addition, for the sake of efficiency, features are usually discretized individually (or univariate). This scheme works based on the assumption that each feature independently influences the task, which may not hold in cases where feature interactions exist. Therefore, univariate discretization may degrade the performance of the FS stage since information showing feature interactions may be lost during the discretization process. Initial results of our previous proposed method [evolve particle swarm optimization (EPSO)] showed that combining discretization and FS in a single stage using bare-bones particle swarm optimization (BBPSO) can lead to a better performance than applying them in two separate stages. In this paper, we propose a new method called potential particle swarm optimization (PPSO) which employs a new representation that can reduce the search space of the problem and a new fitness function to better evaluate candidate solutions to guide the search. The results on ten high-dimensional datasets show that PPSO select less than 5% of the number of features for all datasets. Compared with the two-stage approach which uses BBPSO for FS on the discretized data, PPSO achieves significantly higher accuracy on seven datasets. In addition, PPSO obtains better (or similar) classification performance than EPSO on eight datasets with a smaller number of selected features on six datasets. Furthermore, PPSO also outperforms the three compared (traditional) methods and performs similar to one method on most datasets in terms of both generalization ability and learning capacity.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
A survey on feature selection methods
Chandrashekar, G., & Sahin, F. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.11.024 · Cited by 5,189
Cited by
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-citationSwarm Intelligence Algorithms for Feature Selection: A Review
Brezočnik, L., Fister, I., & Podgorelec, V. (2018) · Applied Sciences · doi:10.3390/app8091521 · Cited by 374
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
Tian, Y., Lu, C., Zhang, X., Tan, K. C., & Jin, Y. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2979930 · Cited by 318
Multiobjective Particle Swarm Optimization for Feature Selection With Fuzzy Cost
Hu, Y., Zhang, Y., & Gong, D. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3015756 · Cited by 277
Metadata
- Authors
- Tran, B., Xue, B., & Zhang, M.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2018-06
- Volume
- 48
- Issue
- 6
- Pages
- 1733-1746
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2639370877
- Cited by
- 203
- References
- 5
- FWCI
- 8.53
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A New Representation in PSO for Discretization-Based Feature Selection. https://app.cochat.ai/papers/10.1109/tcyb.2017.2714145
- The paper
- Tran, B., Xue, B., & Zhang, M. (2018). A New Representation in PSO for Discretization-Based Feature Selection. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2017.2714145
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.