2015
DOI: 10.1007/s11390-015-1556-8
|View full text |Cite
|
Sign up to set email alerts
|

A Structure Learning Algorithm for Bayesian Network Using Prior Knowledge

Abstract: Learning structure from data is one of the most important fundamental tasks of Bayesian network research. Particularly, learning optional structure of Bayesian network is a non-deterministic polynomial-time (NP) hard problem. To solve this problem, many heuristic algorithms have been proposed, and some of them learn Bayesian network structure with the help of different types of prior knowledge. However, the existing algorithms have some restrictions on the prior knowledge, such as quality restriction and use r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…Learning the optional structure of a Bayesian network is NP-hard problem, which means that it requires a huge amount of computation and may not converge to global optima. Prior knowledge of the variables can be incorporated by their dependencies, such as the existence or absence of an edge and even the probability distribution ( Su et al., 2014 ; Xu et al., 2015 ). The results of learned networks get improved while computational cost is reduced.…”
Section: Methods To Integrate Human Knowledgementioning
confidence: 99%
“…Learning the optional structure of a Bayesian network is NP-hard problem, which means that it requires a huge amount of computation and may not converge to global optima. Prior knowledge of the variables can be incorporated by their dependencies, such as the existence or absence of an edge and even the probability distribution ( Su et al., 2014 ; Xu et al., 2015 ). The results of learned networks get improved while computational cost is reduced.…”
Section: Methods To Integrate Human Knowledgementioning
confidence: 99%
“…In such instances, a purely data driven approach to learning the network would be time-consuming due to the large parameter space, and inefficiency at identifying an approximation of the true network structure. Prior knowledge about dependencies between variables can therefore be included in the network structure, while still allowing a data driven approach for unknown dependencies, to improve the overall computation of the network structure (Heckerman et al, 1995 ; Xu et al, 2015 ). The following sections detail the steps taken in the current study to firstly prepare the data for each network, and then obtain the structure of each network that was used for further inference.…”
Section: Methodsmentioning
confidence: 99%
“…Additionally, the performance of the algorithmic learning methods can be improved by including prior knowledge about a part of the structure while learning (Mansinghka et al, 2012;Xu et al, 2015). This ensures that the algorithm learns the structure more efficiently by capturing the prior distribution present in the data that would otherwise be overlooked.…”
Section: Learning Structural Causal Modelsmentioning
confidence: 99%