A novel approximation of basic probability assignment based on rank-level fusion
详细信息    查看全文
文摘
Belief functions theory is an important tool in the field of information fusion. However, when the cardinality of the frame of discernment becomes large, the high computational cost of evidence combination will become the bottleneck of belief functions theory in real applications. The basic probability assignment (BPA) approximations, which can reduce the complexity of the BPAs, are always used to reduce the computational cost of evidence combination. In this paper, both the cardinalities and the mass assignment values of focal elements are used as the criteria of reduction. The two criteria are jointly used by using rank-level fusion. Some experiments and related analyses are provided to illustrate and justify the proposed new BPA approximation approach.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700