- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
37 17 2011 9
Vol.37 No. 17 Computer Engineering September 20 11
·· 2011 A TP181
( 100124)
I-ACO-B
Bayesian Network Structure Learning Algorithm
Based on Chain-model and Particle Swarm
ZHAO Xue-wu, JI Jun-zhong, CHENG Liang, LIU Chun-nian
(College of Computer Science and Technology, Beijing University of Technology, Beijing 100124, China)
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
DOI: 10.3969/j.issn.1000-3428.2011.17.061
1 X {X ,X ,,X }
1 2 n
n (1)
PX( , X ,, X ) PX( | (X ))
1 2 n i i
文档评论(0)