International Journal of Soft Computing

Year: 2008
Volume: 3
Issue: 4
Page No. 321 - 325

Reduct Based Decision Tree (RDT)

Authors : Ramadevi Yellasiri , C.R. Rao , Hari RamaKrishna and T. Prathima

Abstract: 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.

How to cite this article:

Ramadevi Yellasiri , C.R. Rao , Hari RamaKrishna and T. Prathima , 2008. Reduct Based Decision Tree (RDT). International Journal of Soft Computing, 3: 321-325.

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved