.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Machine learning
Graphical models
Learning from incomplete data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
3.0K
Citations:
5.1K
Organization
Cited Papers
.png){kind=icon}
ShareSaveProjecting the spatiotemporal carbon dynamics of the Greater Yellowstone Ecosystem from 2006 to 2050OAAI
OAAIShareSaveShareSave
ShareSaveShareSaveShareSave no more
no more