The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Enhanced recursive feature elimination
Abstract
For classification with small training samples and high dimensionality, feature selection plays an important role in avoiding overfitting problems and improving classification performance. One of the commonly used feature selection methods for small samples problems is recursive feature elimination (RFE) method. RFE method utilizes the generalization capability embedded in support vector machines and is thus suitable for small samples problems. Despite its good performance, RFE tends to discard "weak" features, which may provide a significant improvement of performance when combined with other features. In this paper, we propose an enhanced recursive feature elimination (EnRFE) method for feature selection in small training sample classification. Our experimental results show that the proposed method outperforms the original RFE in terms of classification accuracy on various datasets.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Golub, T. R., Slonim, D. K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J. P., Coller, H., Loh, M. L., Downing, J. R., Caligiuri, M. A., et al. (1999) · Science · doi:10.1126/science.286.5439.531 · Cited by 11,516
(1995) · Cited by 10,558
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
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Alon, U., Barkai, N., Notterman, D. A., Gish, K., Ybarra, S., Mack, D., & Levine, A. J. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.12.6745 · Cited by 4,167
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Shipp, M. A., Ross, K. N., Tamayo, P., Weng, A. P., Kutok, J. L., Aguiar, R. C. T., Gaasenbeek, M., Angelo, M., Reich, M., Pinkus, G. S., et al. (2002) · Nature Medicine · doi:10.1038/nm0102-68 · Cited by 2,428
Prediction of central nervous system embryonal tumour outcome based on gene expression
Pomeroy, S. L., Tamayo, P., Gaasenbeek, M., Sturla, L. M., Angelo, M., McLaughlin, M. E., Kim, J. Y. H., Goumnerova, L. C., Black, P. M., Lau, C., et al. (2002) · Nature · doi:10.1038/415436a · Cited by 2,371
Kelton, D. W., Sadowski, R. P., & Sadowski, D. A. (1998) · Cited by 1,542
Predicting the clinical status of human breast cancer by using gene expression profiles
West, M., Blanchette, C., Dressman, H., Huang, E., Ishida, S., Spang, R., Zuzan, H., Olson, J. A., Marks, J. R., & Nevins, J. R. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.201162998 · Cited by 1,318
Analysis of hidden units in a layered network trained to classify sonar targets
Gorman, R. P., & Sejnowski, T. J. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90023-8 · Cited by 1,114
Use of the zero norm with linear models and kernel methods
Weston, J., Elisseeff, A., Schölkopf, B., & Tipping, M. (2003) · MPG.PuRe (Max Planck Society) · doi:10.5555/944919.944982 · Cited by 688
The Complexity of Optimal Queuing Network Control
Papadimitriou, C. H., & Tsitsiklis, J. N. (1999) · Mathematics of Operations Research · doi:10.1287/moor.24.2.293 · Cited by 469
Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC*
Bertsekas, D. P. (2005) · European Journal of Control · doi:10.3166/ejc.11.310-334 · Cited by 366
Classification of radar returns from the ionosphere using neural networks
Sigillito, V. G. (1989) · Johns Hopkins APL technical digest · Cited by 344
Kernel-based distance metric learning for microarray data classification
Xiong, H., & Chen, X.-W. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-299 · Cited by 58
Self-citationMargin-based wrapper methods for gene identification using microarray
Chen, X.-W. (2006) · Neurocomputing · doi:10.1016/j.neucom.2005.07.007 · Cited by 16
Self-citation
Cited by
Predictive Model to Identify College Students with High Dropout Rates
Hoyos Osorio, J. K., & Daza Santacoloma, G. (2023) · Revista Electrónica de Investigación Educativa · doi:10.24320/redie.2023.25.e13.5398 · Cited by 10
Metadata
- Authors
- Chen, X.-W., & Jeong, J. C.
- Venue
- Sixth International Conference on Machine Learning and Applications (ICMLA 2007)
- Publisher
- IEEE
- Published
- 2007-12
- Pages
- 429-435
- OpenAlex
- W1999466943
- Cited by
- 381
- References
- 20
- FWCI
- 0.55
- Type
- conference paper
- 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.