Bayesian Networks: Learning

Sucar, L. Enrique

doi:10.1007/978-3-030-61943-5_8

Cited by 1 publication

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition: BN can be represented by a two-tuple BN = (G, ), where G = (X , E) is a directed acyclic graph [26]. X = (x 1 , x 2 , .…”

Section: Preliminaries 21 Overview Of Bnmentioning

confidence: 99%

Self-Awakened Particle Swarm Optimization BN Structure Learning Algorithm Based on Search Space Constraint

Liu,

Li,

Zhang

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

To obtain the optimal Bayesian network (BN) structure, researchers often use the hybrid learning algorithm that combines the constraint-based (CB) method and the score-and-search (SS) method. This hybrid method has the problem that the search efficiency could be improved due to the ample search space. The search process quickly falls into the local optimal solution, unable to obtain the global optimal. Based on this, the Particle Swarm Optimization (PSO) algorithm based on the search space constraint process is proposed. In the first stage, the method uses dynamic adjustment factors to constrain the structure search space and enrich the diversity of the initial particles. In the second stage, the update mechanism is redefined, so that each step of the update process is consistent with the current structure which forms a one-to-one correspondence. At the same time, the "self-awakened" mechanism is added to prevent precocious particles from being part of the best. After the fitness value of the particle converges prematurely, the activation operation makes the particles jump out of the local optimal values to prevent the algorithm from converging too quickly into the local optimum. Finally, the standard network dataset was compared with other algorithms. The experimental results showed that the algorithm could find the optimal solution at a small number of iterations and a more accurate network structure to verify the algorithm's effectiveness.

show abstract

“…Definition: BN can be represented by a two-tuple BN = (G, ), where G = (X , E) is a directed acyclic graph [26]. X = (x 1 , x 2 , .…”

Section: Preliminaries 21 Overview Of Bnmentioning

confidence: 99%