Time-constrained cost-sensitive decision tree induction

淡江大學機構典藏 > 商管學院 > 管理科學學系暨研究所 > 期刊論文 > Item 987654321/112803

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/112803

題名:	Time-constrained cost-sensitive decision tree induction
作者:	Yen-Liang Chen;Chia-Chi Wu;Kwei Tang
關鍵詞:	Data mining;Decision analysis;Cost-sensitive learning;Classification;Decision tree
日期:	2016-08
上傳時間:	2018-03-02 12:13:17 (UTC+8)
摘要:	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.
關聯:	Information Sciences 354, p.140-152
顯示於類別:	[管理科學學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	184	檢視/開啟
Time-constrained cost-sensitive decision tree induction.pdf		664Kb	Adobe PDF	1	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章