Towards Theories of Fuzzy Set and Rough Set to Flow Graphs

Mathematical rough set theory and fuzzy set theory have attracted both practical and theoretical researchers from their efficiently and effectively to analyze real-world data. A novel and significant extension is called flow graphs. In this paper, we introduced how to calculate certainly, coverage and strength coefficients of decision rules from fuzzy attributes in a flow graph. Furthermore, we relax concept of mutual exclusion and introduced four new propositions of certainty and coverage coefficients for decision rules extracted from flow graph. An example calculation of these coefficients is provided. We also demonstrate real-world experiment on POSN data set. Several case studies illustrate a desirable outcome.