{"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}
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
