2022
DOI: 10.1016/j.ins.2021.10.052
|View full text |Cite
|
Sign up to set email alerts
|

Learning the structure of Bayesian networks with ancestral and/or heuristic partition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…The steps for BNA have been described previously [37]. Briefly, the analysis involves (i) structure learning using the score-based hill-climbing (HC) learning algorithm, which determines the topological relationships between the nodes in the network and the sample data [38]; (ii) bootstrapping using 10,000 bootstrap samples to prune connections observed in less than 50% of the bootstrap samples [10,37,39,40]; and (iii) parameter learning using the Bayesian method to estimate the conditional probabilities between connected nodes from the identified network and the observed sample data [41].…”
Section: Bayesian Network Analysismentioning
confidence: 99%
“…The steps for BNA have been described previously [37]. Briefly, the analysis involves (i) structure learning using the score-based hill-climbing (HC) learning algorithm, which determines the topological relationships between the nodes in the network and the sample data [38]; (ii) bootstrapping using 10,000 bootstrap samples to prune connections observed in less than 50% of the bootstrap samples [10,37,39,40]; and (iii) parameter learning using the Bayesian method to estimate the conditional probabilities between connected nodes from the identified network and the observed sample data [41].…”
Section: Bayesian Network Analysismentioning
confidence: 99%
“…Note that this time limit applies to the graph search only; it does not include the pre-computation of parent set scores. Tan et al (2022) propose two variable partitioning approaches which they demonstrate can improve learning times in algorithms such as A*, often by orders of magnitude. The first heuristic is ancestral partitioning which assumes a partial ordering as illustrated in Fig.…”
Section: Exact Search Of Node-ordering Spacementioning
confidence: 99%
“…Typically, the BN structure is determined by establishing causal relationships between nodes. For complex systems with unclear internal mechanisms, it can be challenging to clarify these causal relationships, requiring the use of optimization algorithms for BN structure learning [28]. However, in the case of chillers, their thermodynamic principles are relatively well-defined, and the influence relationship between typical faults and features is generally understood.…”
Section: Bn Driven By the Fusion Of Residuals And Datamentioning
confidence: 99%