Is K-fold cross validation the best model selection method for Machine Learning?

机器学习 人工智能 计算机科学 频数推理 参数统计 推论 排列(音乐) 重采样 有界函数 上下界 选型 参数化模型 算法 交叉验证 支持向量机 统计推断 统计假设检验 试验数据 在线机器学习 概率分布 缺少数据 样本量测定 合成数据 元学习(计算机科学) 数据挖掘 核(代数) 计算学习理论 主动学习(机器学习) 分数(化学) 样品(材料) 选择(遗传算法) 后验概率 深度学习 半监督学习 预测推理 基于实例的学习 大概是正确的学习 结果(博弈论)
作者
J.M. Gorriz,R. Martin-Clemente,F. Segovia,J. Ramírez,A. Ortiz,J. Suckling
出处
期刊:Information Fusion [Elsevier BV]
卷期号:: 104404-104404
标识
DOI:10.1016/j.inffus.2026.104404
摘要

As a technique that can compactly represent complex patterns, machine learning has significant potential for predictive inference in multi-source and heterogeneous information fusion scenarios. K-fold cross-validation (CV) is the most common approach for ascertaining the likelihood that a machine learning outcome is generated by chance and frequently outperforms conventional hypothesis testing. This improvement arises from measures directly obtained from machine learning classifications, such as accuracy, that do not have a parametric description. To approach a frequentist analysis within fusion-oriented machine learning pipelines, a permutation test or simple statistics from data partitions (i.e., folds) can be added to estimate confidence intervals. Unfortunately, neither parametric nor non-parametric tests solve the inherent problems of partitioning small sample-size datasets and learning from heterogeneous fused data sources. The fact that machine learning strongly depends on the learning parameters and the distribution of data across folds recapitulates familiar difficulties around excess false positives, uncertainty propagation, and replication. A novel statistical test based on K-fold CV and the Upper Bound of the actual risk (K-fold CUBV) is proposed, where uncertain predictions of machine learning with CV are bounded by the worst case through the evaluation of concentration inequalities. Probably Approximately Correct–Bayesian upper bounds for linear classifiers in combination with K-fold CV are derived and used to estimate the actual risk. Additionally, the origins of the replication problem are demonstrated by modeling and simulating common experimental circumstances, including small sample sizes, low numbers of predictors, and multi-source data heterogeneity. The performance with simulated and neuroimaging datasets suggests that K-fold CUBV is a robust procedure for detecting effects and validating accuracy values obtained from machine learning and classical CV schemes, while avoiding excess false positives in fusion-based inference contexts.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
1秒前
平淡之瑶发布了新的文献求助10
1秒前
1秒前
jiazengwang发布了新的文献求助10
1秒前
小羊同学发布了新的文献求助10
1秒前
2秒前
希成完成签到,获得积分10
2秒前
2秒前
3秒前
甜甜的莞完成签到,获得积分20
3秒前
今后应助115采纳,获得30
3秒前
蒜了蒜了完成签到,获得积分10
4秒前
大个应助天上人间采纳,获得10
4秒前
田様应助善良的傲之采纳,获得10
4秒前
Xiaoduoyu发布了新的文献求助10
4秒前
SciGPT应助圆周率采纳,获得10
4秒前
iFreedom完成签到,获得积分10
5秒前
Lbc发布了新的文献求助10
5秒前
yu发布了新的文献求助10
6秒前
丘比特应助hanyangyang采纳,获得10
6秒前
东方元语应助王鸿博采纳,获得20
6秒前
7秒前
molihuakai应助流星采纳,获得20
7秒前
zz完成签到,获得积分10
7秒前
yang204完成签到,获得积分10
7秒前
大橘发布了新的文献求助10
7秒前
小h发布了新的文献求助10
7秒前
如果应助林晓晓采纳,获得10
7秒前
8秒前
地泽万物发布了新的文献求助10
8秒前
蛋斤发布了新的文献求助10
8秒前
123发布了新的文献求助10
8秒前
充电宝应助踏实的镜子采纳,获得10
8秒前
10秒前
生动凌兰完成签到,获得积分10
10秒前
平淡之瑶完成签到,获得积分20
11秒前
俏皮诺言完成签到,获得积分10
11秒前
路宽宽发布了新的文献求助10
11秒前
11秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Autoparametric Resonance in Mechanical Systems 1000
Effects of Two Weeks of Red Light Therapy on Choroidal Thickness and Axial Length in Young Adults 700
Cosmos as Art Object: Studies in Plato's Timaeus and Other Dialogues 600
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Rutherford's Vascular Surgery and Endovascular Therapy, 2‑Volume Set, 11th Edition 480
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7665232
求助须知:如何正确求助?哪些是违规求助? 9235255
关于积分的说明 19872187
捐赠科研通 7234343
什么是DOI,文献DOI怎么找? 3283354
关于科研通互助平台的介绍 2442260
邀请新用户注册赠送积分活动 2284476