A new version of the rule induction system LERS
Fundamenta Informaticae
Rough set algorithms in classification problem
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Boolean Reasoning for Decision Rules Generation
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Hi-index | 0.00 |
In this paper we focus our attention on the classification problem. We use rough set theory and propose new methods for induction of decision rules. Our approach generalize the concept of a reduct in a dataset. We use minimal set of descriptors gained from decision table. A reduct of descriptors is a set of descriptors which allows us to distinguish between objects as well as the whole set of descriptors present in the dataset. Two types of descriptors are considered: attribute-value and attribute-object-value. We propose appropriate methodology for dealing with descriptors and inducing decision rules. We also present performed experiments on different datasets and compare them with results obtained by other algorithms for object classification based on rough sets.