.png){kind=icon}
返回
A Connection Between Pattern Classification by Machine Learning and Statistical Inference With the General Linear Model
.png){kind=icon}
OA
AI
DOI：10.1109/JBHI.2021.3101662.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A connection between the general linear model (GLM) with frequentist statistical testing and machine learning (MLE) inference is derived and illustrated. Initially, the estimation of GLM parameters is expressed as a Linear Regression Model (LRM) of an indicator matrix; that is, in terms of the inverse problem of regressing the observations. Both approaches, i.e. GLM and LRM, apply to different domains, the observation and the label domains, and are linked by a normalization value in the least-squares solution. Subsequently, we derive a more refined predictive statistical test: the linear Support Vector Machine (SVM), that maximizes the class margin of separation within a permutation analysis. This MLE-based inference employs a residual score and associated upper bound to compute a better estimation of the actual (real) error. Experimental results demonstrate how parameter estimations derived from each model result in different classification performance in the equivalent inverse problem. Moreover, using real data, the MLE-based inference including model-free estimators demonstrates an efficient trade-off between type I errors and statistical power.
Keyword:
Maximum likelihood estimation
Mathematical model
Probability
Linear regression
Bioinformatics
Neuroimaging
Predictive models
General linear model
Linear Regression Model
pattern classification
upper bounds
permutation tests
cross-validation
期刊
IF:
6.8
论文数:
4.7K
被引数:
2.0W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容