Rough sets: probabilistic versus deterministic approach
International Journal of Man-Machine Studies
Inferring decision trees using the minimum description length principle
Information and Computation
Imprecise concept learning within a growing language
Proceedings of the sixth international workshop on Machine learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Variable precision rough set model
Journal of Computer and System Sciences
Data mining and rough set theory
Communications of the ACM
Machine Learning
Time complexity of decision trees
Transactions on Rough Sets III
Hi-index | 0.00 |
This paper presents a new approach for inducing decision trees based on Variable Precision Rough Set Model(VPRSM). From the Rough Set theory point of view, in the process of inducing decision trees, some methods, such as information entropy based methods, emphasize the effect of class distribution. The more unbalanced the class distribution is, the more favorable it is. Whereas the Rough Set based approaches for inducing decision trees emphasize the effect of certainty. The more certain it is, the better it is. Two main concepts, i.e. variable precision explicit region, variable precision implicit region, and the process for inducing decision trees are introduced and discussed in the paper. The comparison between the presented approach and C4.5 on some data sets from the UCI Machine Learning Repository is also reported