Time-constrained cost-sensitive decision tree induction

機構典藏 > College of Business and Management > Department of Management Sciences > Journal Article > Item 987654321/112803

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/112803

Title:	Time-constrained cost-sensitive decision tree induction
Authors:	Yen-Liang Chen;Chia-Chi Wu;Kwei Tang
Keywords:	Data mining;Decision analysis;Cost-sensitive learning;Classification;Decision tree
Date:	2016-08
Issue Date:	2018-03-02 12:13:17 (UTC+8)
Abstract:	A cost-sensitive decision tree is induced for the purpose of building a decision tree from training data that minimizes the sum of the misclassification cost and test cost. Although this problem has been investigated extensively, no previous study has specifically focused on how the decision tree can be induced if the classification task must be completed within a limited time. Accordingly, we developed an algorithm to generate a time-constrained minimal-cost tree. The main idea behind the algorithm is to select the attribute that brings the maximal benefit when time is sufficient, and to select the most time-efficient attribute (i.e., the attribute that provides maximal benefit per unit time) when time is limited. Our experimental results show that the performance of this algorithm is highly satisfactory under various time constraints across distinct datasets.
Relation:	Information Sciences 354, p.140-152
Appears in Collections:	[Department of Management Sciences] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	184	View/Open
Time-constrained cost-sensitive decision tree induction.pdf		664Kb	Adobe PDF	1	View/Open