作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (17): 181-184. doi: 10.3969/j.issn.1000-3428.2011.17.061

• 人工智能及识别技术 • 上一篇    下一篇

基于链模型和粒子群的贝叶斯网结构学习算法

赵学武,冀俊忠,程 亮,刘椿年   

  1. (北京工业大学计算机学院,北京 100124)
  • 收稿日期:2011-03-02 出版日期:2011-09-05 发布日期:2011-09-05
  • 作者简介:赵学武(1983-),男,硕士研究生,主研方向:机器学习;冀俊忠,教授;程 亮,硕士研究生;刘椿年,教授、博士生导师
  • 基金资助:
    北京市自然科学基金资助项目(4102010)

Bayesian Network Structure Learning Algorithm Based on Chain-model and Particle Swarm

ZHAO Xue-wu, JI Jun-zhong, CHENG Liang, LIU Chun-nian   

  1. (College of Computer Science and Technology, Beijing University of Technology, Beijing 100124, China)
  • Received:2011-03-02 Online:2011-09-05 Published:2011-09-05

摘要: 为提高学习贝叶斯网络结构的效率,提出一种基于链模型和粒子群的学习算法。利用包含贝叶斯网节点间因果关系信息的规则链模型来衡量拓扑序列的优劣,提高搜索的拓扑序列的质量,为粒子位置可选择的优化算法加上动态权重系数,平衡全局搜索和局部搜索,提高算法的搜索能力。实验结果表明,与I-ACO-B算法相比,该算法不仅能获得更好的解,且收敛速度也有一定的提高。

关键词: 贝叶斯网结构学习, 粒子群优化算法, 拓扑序列, 规则链模型, 条件独立性测试

Abstract: To improve the efficiency of Bayesian Network(BN) structure learning, this paper developes a novel algorithm based on chain-model and particle swarm. It measures the quality of topological orders with a regular chain-model which contains information of causality between nodes, so that the quality of the searched topological orders is improved. And then the position-selectable updating PSO is optimized with dynamical weighting coefficient, which balances global search and local search and improves search capability. Experimental results show that the novel algorithm can get a better solution, and convergence rate is enhanced with a comparison to the I-ACO-B algorithm.

Key words: Bayesian Network(BN) structure learning, Particle Swarm Optimization(PSO) algorithm, topological order, regular chain-model, conditional independence test

中图分类号: