Rough Sets and Flow Graphs

This paper concerns the relationship between rough sets and flow graphs. It is shown that flow graph can be used both as formal language for computing approximations of sets in the sense of rough set theory, and as description tool for data structure. This description is employed next for finding patterns in data. To this end decision algorithm induced by the flow graph is defined and studied.

[1]  Zdzislaw Pawlak,et al.  Flow Graphs and Decision Algorithms , 2003, RSFDGrC.

[2]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[3]  Zdzisław Pawlak,et al.  Algorithm for inductive learning , 1986 .

[4]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[5]  Salvatore Greco,et al.  Bayesian Confirmation Measures within Rough Set Approach , 2004, Rough Sets and Current Trends in Computing.

[6]  Andrzej Skowron,et al.  Rough mereology: A new paradigm for approximate reasoning , 1996, Int. J. Approx. Reason..

[7]  Shusaku Tsumoto,et al.  Modelling Medical Diagnostic Rules Based on Rough Sets , 1998, Rough Sets and Current Trends in Computing.

[8]  J. G. Carbonell,et al.  Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing , 2003, Lecture Notes in Computer Science.

[9]  Roman Słowiński,et al.  Generalized Decision Algorithms, Rough Inference Rules, and Flow Graphs , 2002, Rough Sets and Current Trends in Computing.

[10]  Massimo Pigliucci,et al.  Bayes’s Theorem , 2022, The SAGE Encyclopedia of Research Design.

[11]  Jan M. Zytkow,et al.  Handbook of Data Mining and Knowledge Discovery , 2002 .

[12]  Zdzislaw Pawlak,et al.  Rough sets, decision algorithms and Bayes' theorem , 2002, Eur. J. Oper. Res..

[13]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .