The DOI matches its Crossref record; the references it cites are not checked yet.
Feature Selection Boosted by Unselected Features
Abstract
Feature selection aims to select strongly relevant features and discard the rest. Recently, embedded feature selection methods, which incorporate feature weights learning into the training process of a classifier, have attracted much attention. However, traditional embedded methods merely focus on the combinatorial optimality of all selected features. They sometimes select the weakly relevant features with satisfactory combination abilities and leave out some strongly relevant features, thereby degrading the generalization performance. To address this issue, we propose a novel embedded framework for feature selection, termed feature selection boosted by unselected features (FSBUF). Specifically, we introduce an extra classifier for unselected features into the traditional embedded model and jointly learn the feature weights to maximize the classification loss of unselected features. As a result, the extra classifier recycles the unselected strongly relevant features to replace the weakly relevant features in the selected feature subset. Our final objective can be formulated as a minimax optimization problem, and we design an effective gradient-based algorithm to solve it. Furthermore, we theoretically prove that the proposed FSBUF is able to improve the generalization ability of traditional embedded feature selection methods. Extensive experiments on synthetic and real-world data sets exhibit the comprehensibility and superior performance of FSBUF.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
The citation lists are queued
They are fetched later and appear here then.
References 50 · Cited by 51
Research works printed but not linked: 8
- Gu, Joint feature selection and subspace learning, 22, 1294
- Taylor, Learning using unselected features (LUFE), 2060
- Yang, A comparative study on feature selection in text categorization, 97, 412
- Grave, Trace lasso: A trace norm regularization for correlated designs, 2187
- Nie, Trace ratio criterion for feature selection, 2, 671
- Bradley, Feature selection via concave minimization and support vector machines, 98, 82
- Zhang, Generalization bounds for domain adaptation, 3320
- Xie, Nonoverlap-promoting variable selection, 5409
Metadata
- Authors
- Zheng, W., Chen, S., Fu, Z., Zhu, F., Yan, H., & Yang, J.
- Affiliations
- Nanjing University of Science and Technology (CN)
- Nanjing Forestry University (CN)
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2022-09
- Volume
- 33
- Issue
- 9
- Pages
- 4562-4574
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W3134283265
- Cited by
- 51
- References
- 50
- Citations by year
- 2026: 5 · 2025: 14 · 2024: 11 · 2023: 12 · 2022: 6
- FWCI
- 2.88
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Neural Networks and Learning Systems (publishedVersion)
- PubMed (publishedVersion)
- Funders
- National Science Fund of China (U1713208, 61876085, 61773215)
- China Postdoctoral Science Foundation (2017M621748, 2019T120430, 2020M681606)
- Major Project of the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (19KJA510004)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Keywords
- feature selection, embedded feature selection, feature weight learning, minimax optimization, generalization performance
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: Feature Selection Boosted by Unselected Features. https://app.cochat.ai/papers/10.1109/tnnls.2021.3058172
- The paper
- Zheng, W., Chen, S., Fu, Z., Zhu, F., Yan, H., & Yang, J. (2022). Feature Selection Boosted by Unselected Features. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2021.3058172
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.