| Time-constrained cost-sensitive decision tree induction | |
|---|---|
| 學年 | 105 |
| 學期 | 1 |
| 出版（發表）日期 | 2016-08-01 |
| 作品名稱 | Time-constrained cost-sensitive decision tree induction |
| 作品名稱（其他語言） | |
| 著者 | Yen-Liang Chen; Chia-Chi Wu; Kwei Tang |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | Information Sciences 354, p.140-152 |
| 摘要 | 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. |
| 關鍵字 | Data mining;Decision analysis;Cost-sensitive learning;Classification;Decision tree |
| 語言 | en |
| ISSN | |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 是 |
| 國別 | CAN |
| 公開徵稿 | |
| 出版型式 | ,電子版 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/112803 ) |
| SDGS | 產業創新與基礎設施 |
GoogleAnalytics