Computing transitive closure of bipolar weighted digraphs
type: Item
instance of: scholarly article
title: Computing transitive closure of bipolar weighted digraphs
zbMATH Open document ID: 1254.05069
author: Patrick Niesink
author: Keven Poulin
author: Mateja Šajna
published in: Discrete Applied Mathematics
publication date: 2012-11-22T00:00:00Z
review text: 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.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C72
zbMATH DE Number: 6109946
zbMATH Keywords: fuzzy cognitive map
zbMATH Keywords: bipolar weighted digraph
zbMATH Keywords: bipolar fuzzy digraph
zbMATH Keywords: bipolar random digraph
zbMATH Keywords: transitive closure
MaRDI profile type: Publication
full work available at URL: j.dam.2012.06.013
OpenAlex ID: W2020284609
DOI: 10.1016/J.DAM.2012.06.013
description: scientific article; zbMATH DE number 6109946