QQ客服 官方微博 反馈留言

	Approximate algorithm of interactive dynamic influence diagrams based on KL distance
	Tian, Le ; Luo, Jian ; Cao, Lang-Cai ; Chen, Zhi-Ping ; Cao LC(曹浪财)
刊名	http://dx.doi.org/10.3969/j.issn.1001-506X.2013.01.35
	2013
关键词	Bioinformatics Expert systems
英文摘要	The model space of interactive dynamic influence diagrams (I-DIDs) is too large and the number of candidate models grows exponentially with the number of time steps. To deal with the high calculation cost issue, a method of solving I-DIDs approximately that combines approximate behavioral principle and discriminative model update algorithm (DMU) is proposed. First, a new definition of behavior equivalence and approximate behavior equivalence of models are presented. Then the candidate models based on the Kullback-Leibler (KL) distance and the action of candidate models are clustered. Afterwards, the top to bottom method is used to merge policy trees into policy graphs. Finally, I-DIDs are solved by using the approach of DMU. The simulation results show that the approximated algorithm can dramatically decrease the number of candidate model and improve the efficiency compared with the traditional DMU algorithm. This research work should be valuable in the research and application of I-DIDs.
语种	英语
出版者	Chinese Institute of Electronics
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/92595]
专题	信息技术－已发表论文
推荐引用方式 GB/T 7714	Tian, Le,Luo, Jian,Cao, Lang-Cai,et al. Approximate algorithm of interactive dynamic influence diagrams based on KL distance[J]. http://dx.doi.org/10.3969/j.issn.1001-506X.2013.01.35,2013.
APA	Tian, Le,Luo, Jian,Cao, Lang-Cai,Chen, Zhi-Ping,&曹浪财.(2013).Approximate algorithm of interactive dynamic influence diagrams based on KL distance.http://dx.doi.org/10.3969/j.issn.1001-506X.2013.01.35.
MLA	Tian, Le,et al."Approximate algorithm of interactive dynamic influence diagrams based on KL distance".http://dx.doi.org/10.3969/j.issn.1001-506X.2013.01.35 (2013).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。