The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cost-sensitive feature selection using two-archive multi-objective artificial bee colony algorithm
Abstract
Since different features may require different costs, the cost-sensitive feature selection problem become more and more important in real-world applications. Generally, it includes two main conflicting objectives, i.e., maximizing the classification performance and minimizing the feature cost. However, most existing approaches treat this task as a single-objective optimization problem. To satisfy various requirements of decision-makers, this paper studies a multi-objective feature selection approach, called two-archive multi-objective artificial bee colony algorithm (TMABC-FS). Two new operators, i.e., convergence-guiding search for employed bees and diversity-guiding search for onlooker bees, are proposed for obtaining a group of non-dominated feature subsets with good distribution and convergence. And two archives, i.e., the leader archive and the external archive are employed to enhance the search capability of different kinds of bees. The proposed TMABC-FS is validated on several datasets from UCI, and is compared with two traditional algorithms and three multi-objective methods. Results have shown that TMABC-FS is an efficient and robust optimization method for solving cost-sensitive feature selection problems.
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
Cited by
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
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-citationA 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., Cheng, S., Shi, Y., Gong, D.-W., & Zhao, X.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2019-12
- Volume
- 137
- Pages
- 46-58
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2953877793
- Cited by
- 210
- References
- 1
- FWCI
- 14.39
- 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: Cost-sensitive feature selection using two-archive multi-objective artificial bee colony algorithm. https://app.cochat.ai/papers/10.1016/j.eswa.2019.06.044
- The paper
- Zhang, Y., Cheng, S., Shi, Y., Gong, D.-W., & Zhao, X. (2019). Cost-sensitive feature selection using two-archive multi-objective artificial bee colony algorithm. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2019.06.044
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.