.png){kind=icon}
返回
Structural-EM for learning PDG models from incomplete data
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2010.01.010.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by other popular models, such as Bayesian Networks. Furthermore, inference can be carried out efficiently over a PDG, in time linear in the size of the model. The problem of learning PDGs from data has been studied in the literature, but only for the case of complete data. We propose an algorithm for learning PDGs in the presence of missing data. The proposed method is based on the Expectation-Maximisation principle for estimating the structure of the model as well as the parameters. We test our proposal on both artificially generated data with different rates of missing cells and real incomplete data. We also compare the PDG models learnt by our approach to the commonly used Bayesian Network (BN) model. The results indicate that the PDG model is less sensitive to the rate of missing data than BN model. Also, though the BN models usually attain higher likelihood, the PDGs are close to them also in size, which makes the learnt PDGs preferable for probabilistic inference purposes. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Machine learning
Graphical models
Learning from incomplete data
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
分享收藏Projecting the spatiotemporal carbon dynamics of the Greater Yellowstone Ecosystem from 2006 to 2050OAAI
OAAI分享收藏An improved Bayesian structural EM algorithm for learning Bayesian networks for clustering一种改进的贝叶斯结构EM算法学习贝叶斯网络聚类
PREAI
分享收藏分享收藏
分享收藏 没有更多内容
没有更多内容