The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Hybrid-Recursive Feature Elimination for Efficient Feature Selection
Open accessAbstract
As datasets continue to increase in size, it is important to select the optimal feature subset from the original dataset to obtain the best performance in machine learning tasks. Highly dimensional datasets that have an excessive number of features can cause low performance in such tasks. Overfitting is a typical problem. In addition, datasets that are of high dimensionality can create shortages in space and require high computing power, and models fitted to such datasets can produce low classification accuracies. Thus, it is necessary to select a representative subset of features by utilizing an efficient selection method. Many feature selection methods have been proposed, including recursive feature elimination. In this paper, a hybrid-recursive feature elimination method is presented which combines the feature-importance-based recursive feature elimination methods of the support vector machine, random forest, and generalized boosted regression algorithms. From the experiments, we confirm that the performance of the proposed method is superior to that of the three single recursive feature elimination methods.
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
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954
A review of feature selection techniques in bioinformatics
Saeys, Y., Inza, I., & Larrañaga, P. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm344 · Cited by 5,244
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Computational Methods of Feature Selection
(2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796 · Cited by 1,271
Data Classification: Algorithms and Applications
Aggarwal, C. C. (2014) · doi:10.1201/b17320?locatt=mode:legacy · Cited by 879
Feature selection for classification: A review
Tang, J., Alelyani, S., & Liu, H. (2014) · doi:10.1201/b17320-7 · Cited by 757
(2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b17320 · Cited by 683
A review of microarray datasets and applied feature selection methods
Bolón-Canedo, V., Sánchez-Maroño, N., Alonso-Betanzos, A., Benítez, J. M., & Herrera, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.05.042 · Cited by 666
Recursive feature elimination with random forest for PTR-MS analysis of agroindustrial products
Granitto, P. M., Furlanello, C., Biasioli, F., & Gasperi, F. (2006) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2006.01.007 · Cited by 663
Feature Selection: A literature Review
Kumar, V. (2014) · The Smart Computing Review · doi:10.6029/smartcr.2014.03.007 · Cited by 659
Cited by
AI-enabled Parkinson's disease screening using smile videos
Adnan, T., Islam, M. S., Lee, S., Wasifur Rahman Chowdhury, E. M., Tithi, S. D., Noshin, K., Islam, M. R., Sarker, I., Rahman, M. S., Schneider, R. B., et al. (2025) · NEJM AI · doi:10.1056/aioa2400950 · Cited by 5
Metadata
- Authors
- Jeon, H., & Oh, S.
- Venue
- Applied Sciences
- Publisher
- MDPI AG
- Published
- 2020-05-04
- Volume
- 10
- Issue
- 9
- Pages
- 3211
- ISSN
- 2076-3417 (ISSN-L)
- OpenAlex
- W3020886002
- Cited by
- 256
- References
- 16
- FWCI
- 11.06
- Type
- journal article
- Language
- en
- Open access
- gold
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: Hybrid-Recursive Feature Elimination for Efficient Feature Selection. https://app.cochat.ai/papers/10.3390/app10093211
- The paper
- Jeon, H., & Oh, S. (2020). Hybrid-Recursive Feature Elimination for Efficient Feature Selection. Applied Sciences. https://doi.org/10.3390/app10093211
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.