Computing transitive closure of bipolar weighted digraphs
The paper uses graph-theoretic tools to analyze fuzzy cognitive maps. It proposes two models. One is called the probabilistic model, where the absolute value of the weight of an impact is interpreted as the probability that the impact occurs. The other is called fuzzy model, where it is interpreted as the degree of truth. In both cases, the fuzzy cognitive map is represented as a bipolar weighted digraph, where the transitive closure definition is dependent on the model. The paper also describes several algorithms for computing the transitive closure of the bipolar weighted digraph in the fuzzy and probabilistic models. Finally, the paper compares the two models and explains how to interpret the results.
scientific article; zbMATH DE number 6109946