Decomposition of belief function in hierarchical hypotheses space

H. Hau
{"title":"Decomposition of belief function in hierarchical hypotheses space","authors":"H. Hau","doi":"10.1109/TAI.1990.130427","DOIUrl":null,"url":null,"abstract":"It is shown that, in a hierarchically structured hypotheses space, any belief function whose focal elements are nodes in the hierarchy is a separable support function. An algorithm is proposed that decomposes such a separable support function into simple support functions. It is shown that the computational complexity of this decomposition algorithm is O(N/sup 2/). Applications of the decomposition of separable support functions to the data fusion problem and the reasoning about control problem are discussed.<<ETX>>","PeriodicalId":366276,"journal":{"name":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1990.130427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is shown that, in a hierarchically structured hypotheses space, any belief function whose focal elements are nodes in the hierarchy is a separable support function. An algorithm is proposed that decomposes such a separable support function into simple support functions. It is shown that the computational complexity of this decomposition algorithm is O(N/sup 2/). Applications of the decomposition of separable support functions to the data fusion problem and the reasoning about control problem are discussed.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
层次假设空间中信念函数的分解
结果表明,在层次结构假设空间中,任何焦点元素为层次节点的信念函数都是可分离的支持函数。提出了一种将可分离支持函数分解为简单支持函数的算法。结果表明,该分解算法的计算复杂度为O(N/sup 2/)。讨论了可分离支持函数分解在数据融合问题和控制问题推理中的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Learning steppingstones for problem solving Conventional and associative memory-based spelling checkers Relationships in an object knowledge representation model A tool for building decision-support-oriented expert systems Generation of feature detectors for texture discrimination by genetic search
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1