dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Ommen, M. van | |
dc.contributor.author | Qian, S. | |
dc.date.accessioned | 2020-11-30T19:00:12Z | |
dc.date.available | 2020-11-30T19:00:12Z | |
dc.date.issued | 2020 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/38203 | |
dc.description.abstract | In this paper we look at some approaches to improve the computational performance of BBES (van Ommen, 2018) algorithm, which aims to learn Bayesian network structure from data. We discuss about how to choose AIC (Akaike information criterion) and BIC (Bayesian information criterion) score in different situations. We give a new branching heuristic based on Graph Attention Network and evaluate it on both simulated continuous data and real-life data. | |
dc.description.sponsorship | Utrecht University | |
dc.format.extent | 2245426 | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | |
dc.title | An Improved Algorithm Based on BBES for Learning Bayesian Network Structure from Data | |
dc.type.content | Master Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.keywords | Bayesian network learning, Graph attention network, Machine learning | |
dc.subject.courseuu | Computing Science | |