The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Optimal number of features as a function of sample size for various classification rules
Open accessAbstract
MOTIVATION: Given the joint feature-label distribution, increasing the number of features always results in decreased classification error; however, this is not the case when a classifier is designed via a classification rule from sample data. Typically (but not always), for fixed sample size, the error of a designed classifier decreases and then increases as the number of features grows. The potential downside of using too many features is most critical for small samples, which are commonplace for gene-expression-based classifiers for phenotype discrimination. For fixed sample size and feature-label distribution, the issue is to find an optimal number of features. RESULTS: Since only in rare cases is there a known distribution of the error as a function of the number of features and sample size, this study employs simulation for various feature-label distributions and classification rules, and across a wide range of sample and feature-set sizes. To achieve the desired end, finding the optimal number of features as a function of sample size, it employs massively parallel computation. Seven classifiers are treated: 3-nearest-neighbor, Gaussian kernel, linear support vector machine, polynomial support vector machine, perceptron, regular histogram and linear discriminant analysis. Three Gaussian-based models are considered: linear, nonlinear and bimodal. In addition, real patient data from a large breast-cancer study is considered. To mitigate the combinatorial search for finding optimal feature sets, and to model the situation in which subsets of genes are co-regulated and correlation is internal to these subsets, we assume that the covariance matrix of the features is blocked, with each block corresponding to a group of correlated features. Altogether there are a large number of error surfaces for the many cases. These are provided in full on a companion website, which is meant to serve as resource for those working with small-sample classification. AVAILABILITY: For the companion website, please visit http://public.tgen.org/tamu/ofs/ CONTACT: e-dougherty@ee.tamu.edu.
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
Gene expression profiling predicts clinical outcome of breast cancer
van 't Veer, L. J., Dai, H., van de Vijver, M. J., He, Y. D., Hart, A. A. M., Mao, M., Peterse, H. L., van der Kooy, K., Marton, M. J., Witteveen, A. T., et al. (2002) · Nature · doi:10.1038/415530a · Cited by 9,536
A Gene-Expression Signature as a Predictor of Survival in Breast Cancer
van de Vijver, M. J., He, Y. D., van 't Veer, L. J., Dai, H., Hart, A. A. M., Voskuil, D. W., Schreiber, G. J., Peterse, J. L., Roberts, C., Marton, M. J., et al. (2002) · New England Journal of Medicine · doi:10.1056/nejmoa021967 · Cited by 6,488
Floating search methods in feature selection
Pudil, P., Novovičová, J., & Kittler, J. (1994) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)90127-9 · Cited by 3,098
On the mean accuracy of statistical pattern recognizers
Hughes, G. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054102 · Cited by 2,859
Feature selection: evaluation, application, and small sample performance
Jain, A., & Zongker, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.574797 · Cited by 2,171
Comparison of algorithms that select features for pattern classifiers
Kudo, M., & Sklansky, J. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00041-2 · Cited by 905
Is cross-validation valid for small-sample microarray classification?
Braga-Neto, U. M., & Dougherty, E. R. (2004) · Bioinformatics · doi:10.1093/bioinformatics/btg419 · Cited by 597
Self-citation39 Dimensionality and sample size considerations in pattern recognition practice
Jain, A. K., & Chandrasekaran, B. (1982) · Handbook of Statistics · doi:10.1016/s0169-7161(82)02042-2 · Cited by 560
On the Possible Orderings in the Measurement Selection Problem
Cover, T. M., & Van Campenhout, J. M. (1977) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1977.4309803 · Cited by 259
On the optimal number of features in the classification of multivariate Gaussian data
Jain, A. K., & Waller, W. G. (1978) · Pattern Recognition · doi:10.1016/0031-3203(78)90008-0 · Cited by 119
On the Effects of Dimension in Discriminant Analysis
Ness, J. W. V., & Simpson, C. (1976) · Technometrics · doi:10.1080/00401706.1976.10489422 · Cited by 69
Exact performance of error estimators for discrete classifiers
Braga-Neto, U., & Dougherty, E. R. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.02.013 · Cited by 65
Self-citationLibsvm : introduction and benchmarks
Chang, C. (2000) · Cited by 30
Hua, J., Xiong, Z., & Dougherty, E. R. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2004.08.007 · Cited by 25
Self-citation
Cited by
Gene selection and classification of microarray data using random forest
Díaz-Uriarte, R., & Alvarez de Andrés, S. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-3 · Cited by 2,929
Machine learning algorithm validation with a limited sample size
Vabalas, A., Gowen, E., Poliakoff, E., & Casson, A. J. (2019) · PLOS ONE · doi:10.1371/journal.pone.0224365 · Cited by 1,901
“This is done because ML algorithms tend to achieve optimal performance in a reduced feature space [6, 16].”
MethodData Preprocessing For Supervised Leaning
Kotsiantis, S. B., Kanellopoulos, D. N., & Pintelas, P. (2007) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.1082414 · Cited by 631
Machine Learning for Electrocatalyst and Photocatalyst Design and Discovery
Mai, H., Le, T. C., Chen, D., Winkler, D. A., & Caruso, R. A. (2022) · Chemical Reviews · doi:10.1021/acs.chemrev.2c00061 · Cited by 552
Performance of feature-selection methods in the classification of high-dimension data
Hua, J., Tembe, W. D., & Dougherty, E. R. (2009) · Pattern Recognition · doi:10.1016/j.patcog.2008.08.001 · Cited by 395
Self-citation
Metadata
- Authors
- Hua, J., Xiong, Z., Lowey, J., Suh, E., & Dougherty, E. R.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-11-30
- Volume
- 21
- Issue
- 8
- Pages
- 1509-1515
- ISSN
- 0266-7061 (ISSN-L)
- 1367-4803
- 1460-2059
- OpenAlex
- W2136487516
- Cited by
- 437
- References
- 14
- FWCI
- 3.17
- Type
- journal article
- Language
- en
- Open access
- bronze
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.