TY  - JOUR
T1  - Reduct Based Decision Tree (RDT)
AU - , Ramadevi Yellasiri AU - , C.R. Rao AU - , Hari RamaKrishna AU - , T. Prathima 
JO  - International Journal of Soft Computing
VL  - 3
IS  - 4
SP  - 321
EP  - 325
PY  - 2008
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2008.321.325
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2008.321.325
KW  - Rough sets
KW  -predominant attributes
KW  -composite reduct
KW  -RDT
KW  -GPCR
AB  - New approaches to compute predominant attributes (referred as reduct) are discussed in this study. Rough Sets concepts and ‘val’ theory are adopted in this process. Procedure to construct a decision tree using these reduct is presented. These trees are referred as Reduct based Decision Tree (RDT). Decision rules for these RDTs are generated. ‘Kappa statistics’ was used to prove the efficiency of this model which is supported by K-fold test.
ER  -