The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Variable-Length Particle Swarm Optimization for Feature Selection on High-Dimensional Classification
Abstract
With a global search mechanism, particle swarm optimization (PSO) has shown promise in feature selection (FS). However, most of the current PSO-based FS methods use a fix-length representation, which is inflexible and limits the performance of PSO for FS. When applying these methods to high-dimensional data, it not only consumes a significant amount of memory but also requires a high computational cost. Overcoming this limitation enables PSO to work on data with much higher dimensionality which has become more and more popular with the advance of data collection technologies. In this paper, we propose the first variable-length PSO representation for FS, enabling particles to have different and shorter lengths, which defines smaller search space and therefore, improves the performance of PSO. By rearranging features in a descending order of their relevance, we facilitate particles with shorter lengths to achieve better classification performance. Furthermore, using the proposed length changing mechanism, PSO can jump out of local optima, further narrow the search space and focus its search on smaller and more fruitful area. These strategies enable PSO to reach better solutions in a shorter time. Results on ten high-dimensional datasets with varying difficulties show that the proposed variable-length PSO can achieve much smaller feature subsets with significantly higher classification performance in much shorter time than the fixed-length PSO methods. The proposed method also outperformed the compared non-PSO FS methods in most cases.
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
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
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
Individual Comparisons by Ranking Methods
Wilcoxon, F. (1945) · Biometrics Bulletin · doi:10.2307/3001968 · Cited by 15,354
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
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
Feature selection for high-dimensional data: a fast correlation-based filter solution
Yu, L., & Liu, H. (2003) · Cited by 2,305
On the Surprising Behavior of Distance Metrics in High Dimensional Space
Aggarwal, C. C., Hinneburg, A., & Keim, D. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_27 · Cited by 2,083
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-citationCorrelation-based Feature Selection for Discrete and Numeric Class Machine Learning
Hall, M. A. (2000) · Cited by 1,715
A Direct Method of Nonparametric Measurement Selection
Whitney, A. W. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223410 · Cited by 851
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
Li, X., & Yao, X. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2112662 · Cited by 745
On the effectiveness of receptors in recognition systems
Marill, T., & Green, D. (1963) · IEEE Transactions on Information Theory · doi:10.1109/tit.1963.1057810 · Cited by 664
A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data
Song, Q., Ni, J., & Wang, G. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.181 · Cited by 663
Xue, B., Zhang, M., & Browne, W. N. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2013.09.018 · Cited by 614
Self-citationYue, C., Qu, B., & Liang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2754271 · Cited by 585
Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems
Sun, C., Jin, Y., Cheng, R., Ding, J., & Zeng, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2675628 · Cited by 425
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
Chen, W.-N., Zhang, J., Chung, H. S. H., Zhong, W.-L., Wu, W.-G., & Shi, Y.-H. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2030331 · Cited by 423
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
Iterative RELIEF for Feature Weighting: Algorithms, Theories, and Applications
Sun, Y. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1093 · Cited by 342
Supervised hybrid feature selection based on PSO and rough sets for medical diagnosis
Inbarani, H. H., Azar, A. T., & Jothi, G. (2014) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2013.10.007 · Cited by 307
Large-scale attribute selection using wrappers
Gutlein, M., Frank, E., Hall, M., & Karwath, A. (2009) · 2009 IEEE Symposium on Computational Intelligence and Data Mining · doi:10.1109/cidm.2009.4938668 · Cited by 264
Banka, H., & Dara, S. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2014.10.007 · Cited by 153
Testing the significance of attribute interactions
Jakulin, A., & Bratko, I. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015377 · Cited by 138
Fitness Functions in Genetic Programming for Classification with Unbalanced Data
Patterson, G., & Zhang, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-76928-6_90 · Cited by 94
Self-citationAn approach to feature selection for keystroke dynamics systems based on PSO and feature weighting
Azevedo, G. L. F. B. G., Cavalcanti, G. D. C., & Filho, E. C. B. C. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4424936 · Cited by 68
Al-Sahaf, H., Zhang, M., Al-Sahaf, A., & Johnston, M. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2685639 · Cited by 68
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
Self-citation
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-citationSong, X.-F., Zhang, Y., Gong, D.-W., & Gao, X.-Z. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3061152 · Cited by 348
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-citation
Metadata
- Authors
- Tran, B., Xue, B., & Zhang, M.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2019-06
- Volume
- 23
- Issue
- 3
- Pages
- 473-487
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2890843359
- Cited by
- 333
- References
- 29
- FWCI
- 12.02
- 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.