机器学习
人工智能
计算机科学
频数推理
参数统计
推论
排列(音乐)
重采样
有界函数
上下界
选型
参数化模型
算法
交叉验证
支持向量机
统计推断
统计假设检验
试验数据
在线机器学习
概率分布
缺少数据
样本量测定
合成数据
元学习(计算机科学)
数据挖掘
核(代数)
计算学习理论
主动学习(机器学习)
分数(化学)
样品(材料)
选择(遗传算法)
后验概率
深度学习
半监督学习
预测推理
基于实例的学习
大概是正确的学习
结果(博弈论)
作者
J.M. Gorriz,R. Martin-Clemente,F. Segovia,J. Ramírez,A. Ortiz,J. Suckling
标识
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI