层次假设空间中信念函数的分解

[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence Pub Date : 1990-11-06 DOI:10.1109/TAI.1990.130427

H. Hau

{"title":"层次假设空间中信念函数的分解","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":"{\"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}","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

摘要

结果表明，在层次结构假设空间中，任何焦点元素为层次节点的信念函数都是可分离的支持函数。提出了一种将可分离支持函数分解为简单支持函数的算法。结果表明，该分解算法的计算复杂度为O(N/sup 2/)。讨论了可分离支持函数分解在数据融合问题和控制问题推理中的应用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Decomposition of belief function in hierarchical hypotheses space

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence

自引率

0.00%

发文量