摘要
针对DSmT混合规则计算和存储复杂度高的问题,提出一种矩阵计算法。该算法对辨识框架的基本元素进行集合编码,从而简化混合规则的组合过程。实验结果表明,该算法使执行时间随辨识框架大小呈指数增加,随证据源数目和焦元数呈线性变化,能有效避免高复杂度。
Aiming at the problem of high complexity in calculation and memory for DSmT mixing rule, this paper proposes a matrix calculation algorithm. This algorithm codes the basic element of discernment frame into a set, simplifies procedure for hybrid rule of combination. Experimental results show that this algorithm makes execution time exponential rising with variation of discernment frame size, and linear variation with variation of evidence source and focal element, it avoids high complexity effectively.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第7期76-78,81,共4页
Computer Engineering
基金
国家自然科学基金资助项目(60872113)
关键词
组合矩阵
混合规则
复杂度
combinatorial matrix
mixing rule
complexity
