The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Binary differential evolution with self-learning for multi-objective feature selection
Abstract
Abstract Feature selection is an important data preprocessing method. This paper studies a new multi-objective feature selection approach, called the Binary Differential Evolution with self-learning (MOFS-BDE). Three new operators are proposed and embedded into the MOFS-BDE to improve its performance. The novel binary mutation operator based on probability difference can guide individuals to rapidly locate potentially optimal areas, the developed One-bit Purifying Search operator (OPS) can improve the self-learning capability of the elite individuals located in the optimal areas, and the efficient non-dominated sorting operator with crowding distance can reduce the computational complexity of the selection operator in the differential evolution. Experimental results on a series of public datasets show that the effective combination of the binary mutation and OPS makes our MOFS-BDE achieve a trade-off between local exploitation and global exploration. The proposed method is competitive in comparison with some representative genetic algorithm-, particle swarm-, differential evolution-, and artificial bee colony-based feature selection algorithms.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
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
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
An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems
Faris, H., Mafarja, M. M., Heidari, A. A., Aljarah, I., Al-Zoubi, A. M., Mirjalili, S., & Fujita, H. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.05.009 · Cited by 660
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
On metrics for comparing nondominated sets
Knowles, J., & Corne, D. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007013 · Cited by 560
An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization
Zhang, X., Tian, Y., Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2308305 · Cited by 531
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
Mafarja, M., Aljarah, I., Heidari, A. A., Hammouri, A. I., Faris, H., Al-Zoubi, A. M., & Mirjalili, S. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.12.037 · Cited by 418
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
Ensemble of differential evolution variants
Wu, G., Shen, X., Li, H., Chen, H., Lin, A., & Suganthan, P. N. (2018) · Information Sciences · doi:10.1016/j.ins.2017.09.053 · Cited by 386
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
Self-citationA 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
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
An evolutionary gravitational search-based feature selection
Taradeh, M., Mafarja, M., Heidari, A. A., Faris, H., Aljarah, I., Mirjalili, S., & Fujita, H. (2019) · Information Sciences · doi:10.1016/j.ins.2019.05.038 · Cited by 234
Feature subset selection using differential evolution and a statistical repair mechanism
Khushaba, R. N., Al-Ani, A., & Al-Jumaily, A. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.03.028 · Cited by 216
Cost-sensitive feature selection using two-archive multi-objective artificial bee colony algorithm
Zhang, Y., Cheng, S., Shi, Y., Gong, D.-W., & Zhao, X. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.06.044 · Cited by 210
Self-citationHybrid 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
On Tchebycheff Decomposition Approaches for Multiobjective Evolutionary Optimization
Ma, X., Zhang, Q., Tian, G., Yang, J., & Zhu, Z. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2704118 · Cited by 199
Relevance–redundancy feature selection based on ant colony optimization
Tabakhi, S., & Moradi, P. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2015.03.020 · Cited by 183
Differential evolution algorithm as a tool for optimal feature subset selection in motor imagery EEG
Baig, M. Z., Aslam, N., Shum, H. P. H., & Zhang, L. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.07.033 · Cited by 167
Multi-objective Feature Selection with NSGA II
Hamdani, T. M., Won, J.-M., Alimi, A. M., & Karray, F. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71618-1_27 · Cited by 163
Ensemble feature selection using bi-objective genetic algorithm
Das, A. K., Das, S., & Ghosh, A. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.02.013 · Cited by 152
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
Mlakar, U., Fister, I., Brest, J., & Potočnik, B. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.07.037 · Cited by 128
On optimum choice of k in nearest neighbor classification
Ghosh, A. K. (2005) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2005.06.007 · Cited by 125
Multi-objective evolutionary feature selection for online sales forecasting
Jiménez, F., Sánchez, G., García, J. M., Sciavicco, G., & Miralles‐Pechuán, L. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.12.045 · Cited by 122
A hybrid feature selection method for DNA microarray data
Chuang, L., Yang, C., Wu, K.-C., & Yang, C.-H. (2011) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2011.02.004 · Cited by 112
Lin, Q., Liu, Z., Yan, Q., Du, Z., Coello, C. A. C., Liang, Z., Wang, W., & Chen, J. (2015) · Information Sciences · doi:10.1016/j.ins.2015.12.022 · Cited by 84
Towards a Memetic Feature Selection Paradigm [Application Notes
Zhu, Z., Jia, S., & Ji, Z. (2010) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2010.936311 · Cited by 79
Multi-Objective Machine Learning
Jin, Y. (2006) · Springer eBooks · doi:10.1007/11399346 · Cited by 74
Application of binary quantum-inspired gravitational search algorithm in feature subset selection
Barani, F., Mirhosseini, M., & Nezamabadi–pour, H. (2017) · Applied Intelligence · doi:10.1007/s10489-017-0894-3 · Cited by 72
Feature selection by optimizing a lower bound of conditional mutual information
Peng, H., & Yong Fan, A. (2017) · Information Sciences · doi:10.1016/j.ins.2017.08.036 · Cited by 63
Feature Selection for Ensembles Using the Multi-Objective Optimization Approach
Oliveira, L. S., Morita, M. E., & Sabourin, R. (2006) · Springer eBooks · doi:10.1007/3-540-33019-4_3 · Cited by 56
Multi-objective feature selection for warfarin dose prediction
Sohrabi, M. K., & Tajik, A. (2017) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2017.06.002 · Cited by 54
A Scalable Memetic Algorithm for Simultaneous Instance and Feature Selection
García‐Pedrajas, N., de Haro-García, A., & Pérez-Rodríguez, J. (2013) · Evolutionary Computation · doi:10.1162/evco_a_00102 · Cited by 51
Cited by
Differential Evolution: A Recent Review Based on State-of-the-Art Works
Ahmad, M. F., Isa, N. A. M., Lim, W. H., & Ang, K. M. (2022) · Alexandria Engineering Journal · doi:10.1016/j.aej.2021.09.013 · Cited by 579
Review of swarm intelligence-based feature selection methods
Rostami, M., Berahmand, K., Nasiri, E., & Forouzandeh, S. (2021) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2021.104210 · Cited by 451
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-citationMultiobjective 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
Self-citation
Metadata
- Authors
- Zhang, Y., Gong, D.-W., Gao, X.-Z., Tian, T., & Sun, X.-Y.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2020-01
- Volume
- 507
- Pages
- 67-85
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2897301007
- Cited by
- 429
- References
- 39
- FWCI
- 24.41
- 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.