Bayesian network structure learning based on HC-PSO algorithm

Structure learning is the core of graph model Bayesian Network learning, and the current mainstream single search algorithm has problems such as poor learning effect, fuzzy initial network, and easy falling into local optimum. In this paper, we propose a heuristic learning algorithm HC-PSO combining...

Full description

Saved in:
Bibliographic Details
Published inJournal of intelligent & fuzzy systems Vol. 46; no. 2; pp. 4347 - 4359
Main Authors Gao, Wenlong, Zhi, Minqian, Ke, Yongsong, Wang, Xiaolong, Zhuo, Yun, Liu, Anping, Yang, Yi
Format Journal Article
LanguageEnglish
Published London, England SAGE Publications 14.02.2024
Sage Publications Ltd
Subjects
Online AccessGet full text
ISSN1064-1246
1875-8967
DOI10.3233/JIFS-236454

Cover

More Information
Summary:Structure learning is the core of graph model Bayesian Network learning, and the current mainstream single search algorithm has problems such as poor learning effect, fuzzy initial network, and easy falling into local optimum. In this paper, we propose a heuristic learning algorithm HC-PSO combining the HC (Hill Climbing) algorithm and PSO (Particle Swarm Optimization) algorithm, which firstly uses HC algorithm to search for locally optimal network structures, takes these networks as the initial networks, then introduces mutation operator and crossover operator, and uses PSO algorithm for global search. Meanwhile, we use the DE (Differential Evolution) strategy to select the mutation operator and crossover operator. Finally, experiments are conducted in four different datasets to calculate BIC (Bayesian Information Criterion) and HD (Hamming Distance), and comparative analysis is made with other algorithms, the structure shows that the HC-PSO algorithm is superior in feasibility and accuracy.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1064-1246
1875-8967
DOI:10.3233/JIFS-236454