Fast discovery of association rules
Advances in knowledge discovery and data mining
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets and Data Mining: Analysis of Imprecise Data
Rough Sets and Data Mining: Analysis of Imprecise Data
Boolean Reasoning for Feature Extraction Problems
ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems
Probabilistic Rough Induction: The GDT-RS Methodology and Algorithms
ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Hi-index | 0.00 |
This paper describes an application of two rough sets based systems, namely generalized distribution table and rough set (GDT-RS) and rough sets with Boolean reasoning (RSBR) respectively, for mining if-then rules in a meningitis dataset. GDT-RS is a soft hybrid induction system, and RSBR is used for discretization of real valued attributes as a pre-processing step realized before the GDT-RS starts. We argue that discretization of continuous valued attributes is an important pre-processing step in the rule discovery process. We illustrate the quality of rules discovered by GDT-RS is strongly affected by the result of discretization.