The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Performance of Machine Learning Algorithms with Different K Values in K-fold CrossValidation
Open accessAbstract
The numerical value of k in a k-fold cross-validation training technique of machine learning predictive models is an essential element that impacts the model’s performance. A right choice of k results in better accuracy, while a poorly chosen value for k might affect the model’s performance. In literature, the most commonly used values of k are five (5) or ten (10), as these two values are believed to give test error rate estimates that suffer neither from extremely high bias nor very high variance. However, there is no formal rule. To the best of our knowledge, few experimental studies attempted to investigate the effect of diverse k values in training different machine learning models. This paper empirically analyses the prevalence and effect of distinct k values (3, 5, 7, 10, 15 and 20) on the validation performance of four well-known machine learning algorithms (Gradient Boosting Machine (GBM), Logistic Regression (LR), Decision Tree (DT) and K-Nearest Neighbours (KNN)). It was observed that the value of k and model validation performance differ from one machine-learning algorithm to another for the same classification task. However, our empirical suggest that k = 7 offers a slight increase in validations accuracy and area under the curve measure with lesser computational complexity than k = 10 across most MLA. We discuss in detail the study outcomes and outline some guidelines for beginners in the machine learning field in selecting the best k value and machine learning algorithm for a given task.
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
The Predictive Sample Reuse Method with Applications
Geisser, S. (1975) · Journal of the American Statistical Association · doi:10.1080/01621459.1975.10479865 · Cited by 2,748 · cited 1×
“Of all the available CV techniques, one commonly used among machine learning practitioners in the k-fold CV [8], due to its user-friendliness and powerful nature in evaluating the success rate of ML models used for classification [5,6,9].”
MethodThe Relationship Between Variable Selection and Data Agumentation and a Method for Prediction
Allen, D. M. (1974) · Technometrics · doi:10.1080/00401706.1974.10489157 · Cited by 1,469 · cited 1×
“In machine learning, one technique used for accessing training models that have received much attention over the years is cross-validation (CV), also known as rotation estimation or out-of-sample testing technique [4,5].”
MethodHands-On Machine Learning with R
Boehmke, B., & Greenwell, B. (2019) · Chapman & Hall/CRC eBooks · doi:10.1201/9780367816377 · Cited by 596
What is an optimal value of k in k-fold cross-validation in discrete Bayesian network analysis?
Marcot, B. G., & Hanea, A. M. (2021) · Computational Statistics · doi:10.1007/s00180-020-00999-9 · Cited by 417
Deep Learning, Sparse Coding, and SVM for Melanoma Recognition in Dermoscopy Images
Codella, N., Cai, J., Abedini, M., Garnavi, R., Halpern, A., & Smith, J. R. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-24888-2_15 · Cited by 379
A comprehensive evaluation of ensemble learning for stock-market prediction
Nti, I. K., Adekoya, A. F., & Weyori, B. A. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00299-5 · Cited by 329
Self-citationCoronavirus (COVID-19) Classification using CT Images by Machine Learning Methods
Barstuğan, M., Özkaya, U., & Öztürk, Ş. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.09424 · Cited by 315
Ghorbani, R., & Ghousi, R. (2020) · IEEE Access · doi:10.1109/access.2020.2986809 · Cited by 289
Tama, B. A., Im, S., & Lee, S. (2020) · BioMed Research International · doi:10.1155/2020/9816142 · Cited by 178
Heart disease identification from patients’ social posts, machine learning solution on Spark
Ahmed, H., Younis, E. M. G., Hendawi, A., & Ali, A. A. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2019.09.056 · Cited by 164
Chui, K. T., Liu, R. W., Zhao, M., & de Pablos, P. O. (2020) · IEEE Access · doi:10.1109/access.2020.2992869 · Cited by 134
Tuarob, S., Tucker, C. S., Salathé, M., & Ram, N. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.03.005 · Cited by 128
A data analytic approach to forecasting daily stock returns in an emerging market
Oztekin, A., Kizilaslan, R., Freund, S., & İşeri, A. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.02.056 · Cited by 112
Efficient Stock-Market Prediction Using Ensemble Support Vector Machine
Nti, I. K., Adekoya, A. F., & Weyori, B. A. (2020) · Open Computer Science · doi:10.1515/comp-2020-0199 · Cited by 102
Self-citationSimsek, S., Kursuncu, U., Kıbış, E. Y., AnisAbdellatif, M., & Dağ, A. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112863 · Cited by 68
Linear model selection by cross-validation
Rao, C. R., & Wu, Y. (2003) · Journal of Statistical Planning and Inference · doi:10.1016/j.jspi.2003.10.004 · Cited by 63
Jung, K., Bae, D., Um, M., Kim, S., Jeon, S., & Park, D. (2020) · Sustainability · doi:10.3390/su12010400 · Cited by 57
Padmaja, D. L., & Vishnuvardhan, B. (2018) · Big Data Research · doi:10.1016/j.bdr.2018.02.007 · Cited by 33
An Optimization-Based Framework for Feature Selection and Parameters Determination of SVMs
Medjahed, S. A., Ouali, M., Saadi, T. A., & Benyettou, A. (2015) · International Journal of Information Technology and Computer Science · doi:10.5815/ijitcs.2015.05.01 · Cited by 10
Cited by
Bhandary, R., & Ghosh, B. K. (2025) · Journal of Risk and Financial Management · doi:10.3390/jrfm18010023 · Cited by 27
Metadata
- Authors
- Department of Computer Science and Informatics, U. O. E. A. N. R., Nti, I. K., Nyarko-Boateng, O., & Aning, J.
- Venue
- International Journal of Information Technology and Computer Science
- Publisher
- MECS Publisher
- Published
- 2021-12-08
- Volume
- 13
- Issue
- 6
- Pages
- 61-71
- ISSN
- 2074-9007 (ISSN-L)
- 2074-9015
- OpenAlex
- W4200136078
- Cited by
- 270
- References
- 19
- FWCI
- 9.97
- Type
- journal article
- Language
- en
- Open access
- diamond
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.