The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Self-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification
Abstract
Many evolutionary computation (EC) methods have been used to solve feature selection problems and they perform well on most small-scale feature selection problems. However, as the dimensionality of feature selection problems increases, the solution space increases exponentially. Meanwhile, there are more irrelevant features than relevant features in datasets, which leads to many local optima in the huge solution space. Therefore, the existing EC methods still suffer from the problem of stagnation in local optima on large-scale feature selection problems. Furthermore, large-scale feature selection problems with different datasets may have different properties. Thus, it may be of low performance to solve different large-scale feature selection problems with an existing EC method that has only one candidate solution generation strategy (CSGS). In addition, it is time-consuming to find a suitable EC method and corresponding suitable parameter values for a given large-scale feature selection problem if we want to solve it effectively and efficiently. In this article, we propose a self-adaptive particle swarm optimization (SaPSO) algorithm for feature selection, particularly for large-scale feature selection. First, an encoding scheme for the feature selection problem is employed in the SaPSO. Second, three important issues related to self-adaptive algorithms are investigated. After that, the SaPSO algorithm with a typical self-adaptive mechanism is proposed. The experimental results on 12 datasets show that the solution size obtained by the SaPSO algorithm is smaller than its EC counterparts on all datasets. The SaPSO algorithm performs better than its non-EC and EC counterparts in terms of classification accuracy not only on most training sets but also on most test sets. Furthermore, as the dimensionality of the feature selection problem increases, the advantages of SaPSO become more prominent. This highlights that the SaPSO algorithm is suitable for solving feature selection problems, particularly large-scale feature selection problems.
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
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,387
How to Make a Decision: The Analytic Hierarchy Process
Saaty, T. L. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90057-i · Cited by 9,605
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Nature-Inspired Metaheuristic Algorithms
Yang, X. (2008) · Medical Entomology and Zoology · Cited by 4,556
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
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization
Qin, A. K., Huang, V. L., & Suganthan, P. N. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.927706 · Cited by 3,614
Floating search methods in feature selection
Pudil, P., Novovičová, J., & Kittler, J. (1994) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)90127-9 · Cited by 3,098
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-citationAn introduction to simulated evolutionary optimization
Fogel, D. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265956 · Cited by 1,503
Feature subset selection using a genetic algorithm
Yang, J., & Honavar, V. (1998) · IEEE Intelligent Systems · doi:10.1109/5254.671091 · Cited by 1,362
Particle 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-citationA Direct Method of Nonparametric Measurement Selection
Whitney, A. W. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223410 · Cited by 851
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
Feature subset selection in large dimensionality domains
Gheyas, I. A., & Smith, L. S. (2010) · Pattern Recognition · doi:10.1016/j.patcog.2009.06.009 · Cited by 597
IEEE International Conference on Neural Networks
(1993) · doi:10.1109/icnn.1993 · Cited by 550
Diversity enhanced particle swarm optimization with neighborhood search
Wang, H., Sun, H., Li, C., Rahnamayan, S., & Pan, J.-S. (2013) · Information Sciences · doi:10.1016/j.ins.2012.10.012 · Cited by 407
A Self-Learning Particle Swarm Optimizer for Global Optimization Problems
Li, C., Yang, S., & Nguyen, T. T. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2171946 · Cited by 384
Zhang, Y., Gong, D.-W., & Cheng, J. (2017) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2015.2476796 · Cited by 379
A self-adaptive artificial bee colony algorithm based on global best for global optimization
Xue, Y., Jiang, J., Zhao, B., & Ma, T. (2018) · Soft Computing · doi:10.1007/s00500-017-2547-1 · Cited by 374
Self-citationIEEE Congress on Evolutionary Computation
(2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.888276 · Cited by 360
Self-adaptive learning based particle swarm optimization
Wang, Y., Li, B., Weise, T., Wang, J., Yuan, B., & Tian, Q. (2011) · Information Sciences · doi:10.1016/j.ins.2010.07.013 · Cited by 347
Feature Extraction With Deep Neural Networks by a Generalized Discriminant Analysis
Stuhlsatz, A., Lippel, J., & Zielke, T. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2183645 · Cited by 151
Scalable and Accurate Online Feature Selection for Big Data
Yu, K., Wu, X., Ding, W., & Pei, J. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2976744 · Cited by 150
Bharti, K. K., & Singh, P. K. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.01.019 · Cited by 141
Feature subset selection using differential evolution and a wheel based search strategy
Al-Ani, A., Alsukker, A., & Khushaba, R. N. (2012) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2012.09.003 · Cited by 132
Convex Sparse PCA for Unsupervised Feature Learning
Chang, X., Nie, F., Yang, Y., Chengqi Zhang, B., & Huang, H. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2910585 · Cited by 108
Xu, R., Anagnostopoulos, G. C., & Wunsch, D. C. (2007) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2007.1009 · Cited by 87
Novel self-adaptive particle swarm optimization methods
Pornsing, C., Sodhi, M. S., & Lamond, B. F. (2015) · Soft Computing · doi:10.1007/s00500-015-1716-3 · Cited by 57
Large-Scale Online Feature Selection for Ultra-High Dimensional Sparse Data
Wu, Y., Hoi, S. C. H., Mei, T., & Yu, N. (2017) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3070646 · Cited by 46
Efficient online learning for multitask feature selection
Yang, H., Lyu, M. R.-T., & King, I. (2013) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2499907.2499909 · Cited by 45
Kamath, U., Compton, J., Islamaj, R., Jong, K. A. D., & Shehu, A. (2012) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2012.53 · Cited by 38
Feature Selection for Social Media Data
Tang, J., & Liu, H. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2629587 · Cited by 29
On Preserving Original Variables in Bayesian PCA With Application to Image Analysis
Li, J., & Tao, D. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2211372 · Cited by 29
Cited by
An improved differential evolution algorithm and its application in optimization problem
Deng, W., Shang, S., Cai, X., Zhao, H., Song, Y., & Xu, J. (2021) · Soft Computing · doi:10.1007/s00500-020-05527-x · Cited by 383
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
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
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
Metadata
- Authors
- Xue, Y., Xue, B., & Zhang, M.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2019-09-24
- Volume
- 13
- Issue
- 5
- Pages
- 1-27
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W2997585558
- Cited by
- 342
- References
- 35
- FWCI
- 19.69
- 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.