.png){kind=icon}
返回
Learning Bayesian network parameters via minimax algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2019.03.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Parameter learning is an important aspect of learning in Bayesian networks. Although the maximum likelihood algorithm is often effective, it suffers from overfitting when there is insufficient data. To address this, prior distributions of model parameters are often imposed. When training a Bayesian network, the parameters of the network are optimized to fit the data. However, imposing prior distributions can reduce the fitness between parameters and data. Therefore, a trade-off is needed between fitting and overfitting. In this study, a new algorithm, named MiniMax Fitness (MMF) is developed to address this problem. The method includes three main steps. First, the maximum a posterior estimation that combines data and prior distribution is derived. Then, the hyper-parameters of the prior distribution are optimized to minimize the fitness between posterior estimation and data. Finally, the order of posterior estimation is checked and adjusted to match the order of the statistical counts from the data. In addition, we introduce an improved constrained maximum entropy method, named Prior Free Constrained Maximum Entropy (PF-CME), to facilitate parameter learning when domain knowledge is provided. Experiments show that the proposed methods outperforms most of existing parameter learning methods. (C) 2019 Elsevier Inc. All rights reserved.
Keyword:
Bayesian network
Overfitting
Minimax algorithm
Maximum entropy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
Asymptotics of reaction–diffusion fronts with one static and one diffusing reactant具有一个静态和一个扩散反应物的反应扩散前沿的渐近性OAAI
OAAI分享收藏分享收藏
查看更多内容