【摘要】：將團樹傳播算法應用于證據(jù)網(wǎng)絡中,解決復雜的多連通知識網(wǎng)絡結(jié)構(gòu)下的信度推理問題.將復雜多連通網(wǎng)絡構(gòu)造成一棵團樹,并將聯(lián)合信度作為團節(jié)點的參數(shù)實現(xiàn)復雜多連通網(wǎng)絡結(jié)構(gòu)上的證據(jù)網(wǎng)絡信度推理.在進行聯(lián)合信度函數(shù)信息融合的過程中,通過引入兩種新的交并運算實現(xiàn)對DSm T組合規(guī)則的改進,減少不確定性.最后通過實例驗證了所提出方法的可行性.
[Abstract]:The cluster tree propagation algorithm is applied to the evidence network to solve the reliability reasoning problem under the complex multi-connected knowledge network structure. The complex multi-connected network is constructed into a cluster tree, and the joint reliability is taken as the parameter of the cluster node to realize the reliability reasoning of the evidential network on the complex multi-connected network structure. In the process of information fusion of joint reliability function, two new intersection and union operations are introduced to improve DSm T combination rules and reduce uncertainty. Finally, the feasibility of the proposed method is verified by an example.
【作者單位】： 江西師范大學數(shù)學與信息科學學院;
【基金】：江西省自然科學基金項目(20151BAB207030) 江西省教育廳科技項目(GJJ14244)
【分類號】：TP202
，

本文編號：2197878