4.6 Article

An Improved Particle Swarm Optimization Algorithm for Bayesian Network Structure Learning via Local Information Constraint

Journal

IEEE ACCESS
Volume 9, Issue -, Pages 40963-40971

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3065532

Keywords

Bayes methods; Statistics; Sociology; Search problems; Particle swarm optimization; Feature extraction; Encoding; Bayesian network; structure learning; local information; particle swarm optimization algorithm

Funding

  1. Hainan Natural Science Foundation Innovation Research Team Project [620CXTD434]
  2. Hainan Provincial Natural Science Foundation of China [519QN180]
  3. National Natural Science Foundation of China [61961160706, 0066/2019/AFJ]
  4. Macau Science and Technology Development [61961160706, 0066/2019/AFJ]
  5. Scientific Research Foundation of Hainan University [KYQD(ZR)1859]

Ask authors/readers for more resources

The study introduces a Bayesian network structure optimization method based on local information, which constructs an initial network framework and utilizes particle swarm optimization algorithm to improve efficiency and accuracy.
At present, in the application of Bayesian network (BN) structure learning algorithm for structure learning, the network scale increases with the increase of number of nodes, resulting in a large scale of structure search space, which is difficult to calculate, and the existing learning algorithms are inefficient, making BN structure learning difficulty increase. To solve this problem, a BN structure optimization method based on local information is proposed. Firstly, it proposes to construct an initial network framework with local information and uses the Max-Min Parents and Children (MMPC) algorithm to construct an undirected network framework to reduce the search space. Then the particle swarm optimization (PSO) algorithm is used to strengthen the algorithm's optimization ability by constructing a new position and velocity update rule and improve the efficiency of the algorithm. Experimental results show that under the same sample data set, the algorithm can obtain a more accurate BN structure while converging quickly, which verifies the correctness and effectiveness of the algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available