Constructing a decision tree from data with hierarchical class labels

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29651

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29651

题名:	Constructing a decision tree from data with hierarchical class labels
作者:	Chen,YL;Hu,HW;Tang,K
贡献者:	資訊管理研究所
日期:	2009
上传时间:	2010-06-29 20:37:22 (UTC+8)
出版者:	中央大學
摘要:	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.
關聯:	EXPERT SYSTEMS WITH APPLICATIONS
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	736	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing