Hybrid decision tree based on inferred attribute

Authors:
K. Hima Bindu;P. S. V. S. Sai Prasad;C. Raghavendra Rao
Affiliations:
University of Hyderabad, Hyderabad, Andhra Pradesh, India;University of Hyderabad, Hyderabad, Andhra Pradesh, India;University of Hyderabad, Hyderabad, Andhra Pradesh, India
Venue:
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Year:
2010

Citing 4
Cited 0

RSES and RSESlib - A Collection of Tools for Rough Set Computations

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Radial Basis Functions

Radial Basis Functions
Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques
A New Decision Tree Algorithm Based on Rough Set Theory

APCIP '09 Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a novel hybrid approach based on Regression, Rough sets and a Classifier aiming at effective dimensionality reduction henceforth a classifier with less time complexity. It focuses on dimension enhancement by embedding Inferred Attribute into the decision table, named as Augmented Decision Table (ADT). An effective minimal set of attributes (reduct) are derived by employing Rough set theory on ADT. The projected ADT based on the reduct is used for building a classifier. The philosophy is demonstrated by considering popular functional forms for Inferred Attribute like Linear Regression and Quadratic Regression and by adopting CART as the classifier. It is observed that inclusion of Inferred Attribute reduces the size of the reduct significantly without compromising the accuracy. However improvement in classification time depends on the choice of the Inferred Attribute model form.