The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Multiobjective Particle Swarm Optimization for Feature Selection With Fuzzy Cost
Abstract
Feature selection (FS) is an important data processing technique in the field of machine learning. There have been various FS methods, but all assume that the cost associated with a feature is precise, which restricts their real applications. Focusing on the FS problem with fuzzy cost, a fuzzy multiobjective FS method with particle swarm optimization, called PSOMOFS, is studied in this article. The proposed method develops a fuzzy dominance relationship to compare the goodness of candidate particles and defines a fuzzy crowding distance measure to prune the elitist archive and determine the global leader of particles. Also, a tolerance coefficient is introduced into the proposed method to ensure that the Pareto-optimal solutions obtained satisfy decision makers' preferences. The developed method is used to tackle a series of the UCI datasets and is compared with three fuzzy multiobjective evolutionary methods and three typical multiobjective FS methods. Experimental results show that the proposed method can achieve feature sets with superior performances in approximation, diversity, and feature cost.
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
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
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
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
Binary differential evolution with self-learning for multi-objective feature selection
Zhang, Y., Gong, D.-W., Gao, X.-Z., Tian, T., & Sun, X.-Y. (2020) · Information Sciences · doi:10.1016/j.ins.2019.08.040 · Cited by 429
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
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-citationSelf-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification
Xue, Y., Xue, B., & Zhang, M. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3340848 · Cited by 342
Cited by
A review of surrogate-assisted evolutionary algorithms for expensive optimization problems
He, C., Zhang, Y., Gong, D., & Ji, X. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119495 · Cited by 272
Self-citation
Metadata
- Authors
- Hu, Y., Zhang, Y., & Gong, D.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2021-02
- Volume
- 51
- Issue
- 2
- Pages
- 874-888
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W3086548118
- Cited by
- 277
- References
- 39
- FWCI
- 14.68
- 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: Multiobjective Particle Swarm Optimization for Feature Selection With Fuzzy Cost. https://app.cochat.ai/papers/10.1109/tcyb.2020.3015756
- The paper
- Hu, Y., Zhang, Y., & Gong, D. (2021). Multiobjective Particle Swarm Optimization for Feature Selection With Fuzzy Cost. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2020.3015756
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.