TY - JOUR
T1 - Indirect disjunctive belief rule base modeling using limited conjunctive rules
T2 - Two possible means
AU - Chang, Leilei
AU - Chen, Yuwang
AU - Hao, Zhiyong
AU - Zhou, Zhijie
AU - Xu, Xiaobin
AU - Tan, Xu
PY - 2019/5/1
Y1 - 2019/5/1
N2 - A traditional Belief Rule Base (BRB) is constructed under the conjunctive assumption (conjunctive BRB), which requires covering the traversal combinations of the referenced values for the attributes. Consequentially, a traditional conjunctive BRB may have to face the combinatorial explosion problem when there are too many attributes and/or referenced values for the attributes. It is difficult or at least expensive to construct a complete conjunctive BRB, while it is easy to derive one or several conjunctive rules. Comparatively, a BRB under the disjunctive assumption (disjunctive BRB) requires only covering the referenced values for the attributes instead of the traversal combination of them. Thus, the combinatorial explosion problem can be avoided. However, it is difficult to directly obtain a disjunctive BRB from either historical data or experts’ knowledge. To combine the advantages of both conjunctive and disjunctive BRBs, a new approach is proposed to construct a disjunctive BRB using a limited number of conjunctive rules (insufficient to construct a complete conjunctive BRB). In the new disjunctive BRB modeling approach, each disjunctive rule is derived by quantifying its correlation with one or multiple conjunctive rules. To do so, two means for belief generation are proposed, namely, equal probability and self-organizing mapping (SOM). Two cases are studied for validating the efficiency of the proposed approach. The results by the disjunctive BRB show consistency with those derived by the conjunctive BRB as well as other approaches, which validates the efficiency of the proposed approach considering that the disjunctive BRB is constructed with only a limited number of conjunctive rules.
AB - A traditional Belief Rule Base (BRB) is constructed under the conjunctive assumption (conjunctive BRB), which requires covering the traversal combinations of the referenced values for the attributes. Consequentially, a traditional conjunctive BRB may have to face the combinatorial explosion problem when there are too many attributes and/or referenced values for the attributes. It is difficult or at least expensive to construct a complete conjunctive BRB, while it is easy to derive one or several conjunctive rules. Comparatively, a BRB under the disjunctive assumption (disjunctive BRB) requires only covering the referenced values for the attributes instead of the traversal combination of them. Thus, the combinatorial explosion problem can be avoided. However, it is difficult to directly obtain a disjunctive BRB from either historical data or experts’ knowledge. To combine the advantages of both conjunctive and disjunctive BRBs, a new approach is proposed to construct a disjunctive BRB using a limited number of conjunctive rules (insufficient to construct a complete conjunctive BRB). In the new disjunctive BRB modeling approach, each disjunctive rule is derived by quantifying its correlation with one or multiple conjunctive rules. To do so, two means for belief generation are proposed, namely, equal probability and self-organizing mapping (SOM). Two cases are studied for validating the efficiency of the proposed approach. The results by the disjunctive BRB show consistency with those derived by the conjunctive BRB as well as other approaches, which validates the efficiency of the proposed approach considering that the disjunctive BRB is constructed with only a limited number of conjunctive rules.
KW - Disjunctive belief rule base (BRB)
KW - Equal probability
KW - Indirect modeling
KW - Limited conjunctive rules
KW - Self-organizing map (SOM)
UR - http://www.scopus.com/inward/record.url?scp=85062430250&partnerID=8YFLogxK
U2 - 10.1016/j.ijar.2019.02.006
DO - 10.1016/j.ijar.2019.02.006
M3 - Article
AN - SCOPUS:85062430250
SN - 0888-613X
VL - 108
SP - 1
EP - 20
JO - International Journal of Approximate Reasoning
JF - International Journal of Approximate Reasoning
ER -