Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Intelligent Data Analysis: An Introduction
Intelligent Data Analysis: An Introduction
Generalized Decision Algorithms, Rough Inference Rules, and Flow Graphs
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Rough Sets and Current Trends in Computing: 5th International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Proceedings (Lecture Notes in Computer Science)
Inference and Reformation in Flow Graphs Using Granular Computing
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Rough Set Flow Graphs and Max - * Fuzzy Relation Equations in State Prediction Problems
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Extended Pawlak's Flow Graphs and Information Theory
Transactions on Computational Science V
Knowledge discovery by rough sets mathematical flow graphs and its extension
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Interpretation of extended Pawlak flow graphs using granular computing
Transactions on rough sets VIII
Research on rough set theory and applications in China
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
Mining for paths in flow graphs
ICDM'10 Proceedings of the 10th industrial conference on Advances in data mining: applications and theoretical aspects
An extension of pawlak's flow graphs
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
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 II
Flow graphs and decision tables with fuzzy attributes
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Sufficiently Near Neighbourhoods of Points in Flow Graphs. A Near Set Approach
Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications
Weak Dependencies in Approximation Spaces
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Adaptive Method of Adjusting Flowgraph for Route Reconstruction in Video Surveillance Systems
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Ant-Based Clustering in Delta Episode Information Systems Based on Temporal Rough Set Flow Graphs
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
In this paper we propose a new approach to data mining and knowledge discovery based on information flow distribution in a flow graph. Flow graphs introduced in this paper are different from those proposed by Ford and Fulkerson for optimal flow analysis and they model flow distribution in a network rather than the optimal flow which is used for information flow examination in decision algorithms. It is revealed that flow in a flow graph is governed by Bayes’ rule, but the rule has an entirely deterministic interpretation without referring to its probabilistic roots. Besides, a decision algorithm induced by a flow graph and dependency between conditions and decisions of decision rules is introduced and studied, which is used next to simplify decision algorithms.