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

计算机工程 ›› 2009, Vol. 35 ›› Issue (22): 191-193. doi: 10.3969/j.issn.1000-3428.2009.22.065

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

基于蚁群优化的DBN转移网络结构学习算法

胡仁兵,冀俊忠,张鸿勋,刘椿年   

  1. (北京工业大学计算机学院多媒体与智能软件技术北京市重点实验室,北京 100124)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-11-20 发布日期:2009-11-20

Structure Learning Algorithm for DBN Transition Networks Based on Ant Colony Optimization

HU Ren-bing, JI Jun-zhong, ZHANG Hong-xun, LIU Chun-nian   

  1. (Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, College of Computer Science, Beijing University of Technology, Beijing 100124)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-11-20 Published:2009-11-20

摘要: 针对动态贝叶斯转移网络的特点,以I-ACO-B为基础,提出基于蚁群优化的分步构建转移网络的结构学习算法ACO-DBN-2S。算法将转移网络的结构学习分为时间片之间和时间片内2个步骤进行,通过改进隔代优化策略,减少无效优化次数。标准数据集下的大量实验结果证明,该算法能更有效地处理大规模数据,学习精度和速度有较大改进。

关键词: 动态贝叶斯网络, 转移网络, 结构学习, 蚁群优化

Abstract: Aiming at the characteristics of dynamic Bayesian transition networks, this paper proposes a structure learning algorithm based on Ant Colony Optimization(ACO) named ACO-DBN-2S by extending the static Bayesian networks structure leaning algorithm I-ACO-B. In ACO-DBN-2S, ants select arcs from the inter-arcs between time slices before from the intra-arcs in one slice, and the interval optimization strategy is improved by decreasing the times of optimization operation. A number of experiments under standard datasets demonstrate the algorithm can handle large data, and the precision and speed of learning are improved.

Key words: Dynamic Bayesian Networks(DBN), transition networks, structure learning, Ant Colony Optimization(ACO)

中图分类号: