期刊文献+

基于禁忌搜索的贝叶斯网结构学习算法 被引量:1

A Tabu-search Based Bayesian Network Structure Learning Algorithm
下载PDF
导出
摘要 针对随机搜索机制学习算法参数设置较多的不足,提出了一种基于禁忌搜索的贝叶斯网结构学习算法.此算法首先利用加边、减边、逆向边3个算子产生当前解的邻域,然后结合禁忌表和蔑视准则以引导和限制搜索过程,2个步骤迭代进行,直至达到全局最优解或近似最优解.仿真实验表明,此算法不仅具有结构简单、参数少、易于实现的特点,而且求解质量也能得到保证. To solve the drawbacks of the random searching based algorithms for learning Bayesian networks, we introduced the Tabu search into Bayesian network structure learning problems, proposed a Tabu-search-based Bayesian network structure learning algorithm (TBN). First, the new algorithm generates the neighborhood solutions by add, subtract and reverse arc operators. And then, the Tabu list and aspiration criteria guide the search procedure corporately. After the iteration of the two steps above, the algorithm will finally obtain optimal or near optimal solutions. The experiment results on the benchmark data sets show that TBN has a simpler structure and faster speed.
出处 《北京工业大学学报》 EI CAS CSCD 北大核心 2011年第8期1274-1280,共7页 Journal of Beijing University of Technology
基金 北京市自然科学基金资助项目(4102010)
关键词 贝叶斯网 禁忌搜索 结构学习 Bayesian networks tabu search structure learning
  • 相关文献

参考文献16

  • 1PEARL J. Fusion, propagation, and structuring in belief networks [ J ]. Artificial Intelligence, 1986, 29 ( 3 ) : 241-288.
  • 2COOPER G F, HERSKOVITS E. A Bayesian method for the induction of probabilistic networks from data [ J]. Machine Learning, 1992, 9(4): 309-347.
  • 3CHENG J, GREINER R, KELLY J, et al. Learning Bayesian networks from data: an information-theory based approach[J]. Artificial Intelligence, 2002, 137(1-2) : 43-90.
  • 4WONG M L, LEUNG K S. An efficient data mining method for learning Bayesian networks using an evolutionary algorithm- based hybrid approach[ J]. IEEE Transactions on Evolutionary Computation, 2004, 8 (4) : 378-404.
  • 5刘大有,王飞,卢奕南,薛万欣,王松昕.基于遗传算法的Bayesian网结构学习研究[J].计算机研究与发展,2001,38(8):916-922. 被引量:43
  • 6de CAMPOS L M, FERNANDEZ-LUNA J M, GAMEZ J A, et al. Ant colony optimization for learning Bayesian networks[ J].International Journal of Approximate Reasoning, 2002, 31 (3) : 291-311.
  • 7JI Jun-Zhong ZHANG Hong-Xun HU Ren-Bing LIU Chun-Nian.A Bayesian Network Learning Algorithm Based on Independence Test and Ant Colony Optimization[J].自动化学报,2009,35(3):281-288. 被引量:20
  • 8ROBINSON R W. Counting unlabeled acyclic digraphs[ J]. Lecture Notes in Mathematics, 1977, 622: 28-43.
  • 9CHICKERING D M, GEIGER D, HECKERMAN D. Learning Bayesian networks is NP-hard[ R]. Redmond, WA: Microsoft Research, 1994: 1287-1330.
  • 10GLOVER F. Future paths for integer programming and links to artificial intelligence[ J ]. Computers & Operations Research, 1986, 13(5) : 533-549.

二级参考文献7

共引文献60

同被引文献3

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部