Constructing a decision tree from data with hierarchical class labels

NCUIR > School of Management at National Central University > Graduate Institute of Information Management > journal & Dissertation > Item 987654321/29651

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29651

Title:	Constructing a decision tree from data with hierarchical class labels
Authors:	Chen,YL;Hu,HW;Tang,K
Contributors:	資訊管理研究所
Date:	2009
Issue Date:	2010-06-29 20:37:22 (UTC+8)
Publisher:	中央大學
Abstract:	Most decision tree classifiers are designed to classify the data with categorical or Boolean class labels. Unfortunately, many practical classification problems concern data with class labels that are naturally organized as a hierarchical structure, such as test scores. In the hierarchy, the ranges in the upper levels are less specific but easier to predict, while the ranges in the lower levels are more specific but harder to predict. To build a decision tree from this kind of data, we must consider how to classify data so that the class label can be as specific as possible while also ensuring the highest possible accuracy of the prediction. To the best of our knowledge, no previous research has considered the induction of decision trees from data with hierarchical class labels. This paper proposes a novel classification algorithm for learning decision tree classifiers from data with hierarchical class labels. Empirical results show that the proposed method is efficient and effective in both prediction accuracy and prediction specificity. (C) 2008 Elsevier Ltd. All rights reserved.
Relation:	EXPERT SYSTEMS WITH APPLICATIONS
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	738	View/Open

社群 sharing