Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Gao, Wenlonga; b; c; * | Zhi, Minqianc | Ke, Yongsongc | Wang, Xiaolongc | Zhuo, Yunc | Liu, Anpingc | Yang, Yic
Affiliations: [a] Institute of Health Statistics and Intelligent Analysis, School of Public Health, Lanzhou University, Lanzhou, Gansu, P. R. China | [b] Department of Epidemiology and Health Statistics, School of Public Health, Lanzhou University, Lanzhou, Gansu, P. R. China | [c] School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu, P. R. China
Correspondence: [*] Corresponding author. Dr. Marcel M. Verbeek, TML, r.830, Department of Neurology, Radboud University Medical Center, P.O. Box 9101, 6500 HB Nijmegen, the Netherlands. Tel.: +31 24 36 14567; Fax: +31 2436 68754; E-mail: gaowl2019@sina.com.
Note: [] http://orcid.org/0000-0001-6845-4541.
Abstract: 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.
Keywords: Keywords. Bayesian network, structure learning, HC algorithm, PSO algorithm, DE algorithm
DOI: 10.3233/JIFS-236454
Journal: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 2, pp. 4347-4359, 2024
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl