【摘要】：將團(tuán)樹傳播算法應(yīng)用于證據(jù)網(wǎng)絡(luò)中,解決復(fù)雜的多連通知識網(wǎng)絡(luò)結(jié)構(gòu)下的信度推理問題.將復(fù)雜多連通網(wǎng)絡(luò)構(gòu)造成一棵團(tuán)樹,并將聯(lián)合信度作為團(tuán)節(jié)點(diǎn)的參數(shù)實(shí)現(xiàn)復(fù)雜多連通網(wǎng)絡(luò)結(jié)構(gòu)上的證據(jù)網(wǎng)絡(luò)信度推理.在進(jìn)行聯(lián)合信度函數(shù)信息融合的過程中,通過引入兩種新的交并運(yùn)算實(shí)現(xiàn)對DSm T組合規(guī)則的改進(jìn),減少不確定性.最后通過實(shí)例驗(yàn)證了所提出方法的可行性.
[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.
【作者單位】： 江西師范大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院;
【基金】：江西省自然科學(xué)基金項(xiàng)目(20151BAB207030) 江西省教育廳科技項(xiàng)目(GJJ14244)
【分類號】：TP202
，

本文編號：2197878