An Exploration of a Set Entropy-Based Hybrid Splitting Methods for Decision Tree Induction

View Sample PDF

Author(s): Kweku-Muata Osei-Bryson (Virginia Commonwealth University, USA)and Kendall Giles (Virginia Commonwealth University, USA)
Copyright: 2004
Volume: 15
Issue: 3
Pages: 17
Source title: Journal of Database Management (JDM)
Editor(s)-in-Chief: Keng Siau (City University of Hong Kong, Hong Kong SAR)
DOI: 10.4018/jdm.2004070101

Keywords: Data Mining and Databases / Databases / Information Science Reference / Library & Information Science

Purchase

View An Exploration of a Set Entropy-Based Hybrid Splitting Methods for Decision Tree Induction on the publisher's website for pricing and purchasing information.

Abstract

Decision tree (DT) induction is among the more popular of the data mining techniques. An important component of DT induction algorithms is the splitting method, with the most commonly used method being based on the Conditional Entropy family. However, it is well known that there is no single splitting method that will give the best performance for all problem instances. In this paper, we develop and explore hybrid splitting methods from two entropy-based families: the Conditional Entropy family and another family that is based on the Class-Attribute Mutual Information (CAMI). We compare conventional splitting methods based on single measures with hybrid splitting methods based on multiple measures. The results suggest that the hybrid methods could be competitive in terms of classification accuracy and are thus worthy of future research.

The IRMA Community

Research IRM

An Exploration of a Set Entropy-Based Hybrid Splitting Methods for Decision Tree Induction

Purchase

Abstract

Related Content

IRMA Sponsors