Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Flow graphs and decision algorithms
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Decision trees and flow graphs
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
An interpretation of flow graphs by granular computing
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
The computational complexity of inference using rough set flow graphs
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Transactions on Rough Sets III
Extended Pawlak's Flow Graphs and Information Theory
Transactions on Computational Science V
Interpretation of extended Pawlak flow graphs using granular computing
Transactions on rough sets VIII
Novel matrix forms of rough set flow graphs with applications to data integration
Computers & Mathematics with Applications
An extension of rough set approximation to flow graph based data analysis
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Hi-index | 0.00 |
Mathematical rough set theory has attracted both practical and theoretical researchers. A significant extension of rough set theory is called flow graphs. It is a knowledge representation in the form of information flow. Flow graph is a promising approach to analyze data flow, decision trees, decision rules, probability learning, etc. In this article, we present their connections to pertinent techniques and propose a new extension to association rules. Two new propositions are used to reveal the relationship between flow graphs and association rules. We conduct experiment on real-world data collected from POSN with the evaluation. We discuss some important properties of flow graphs, with examples throughout.