| dc.contributor | 企管系 | |
| dc.creator (作者) | 唐揆 | |
| dc.creator (作者) | Tang, Kwei | |
| dc.date (日期) | 2019-03 | |
| dc.date.accessioned | 16-Apr-2020 11:44:13 (UTC+8) | - |
| dc.date.available | 16-Apr-2020 11:44:13 (UTC+8) | - |
| dc.date.issued (上傳時間) | 16-Apr-2020 11:44:13 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/129261 | - |
| dc.description.abstract (摘要) | Measuring an attribute may consume several types of resources. For example, a blood test has a cost and needs to wait for a result. Resource constraints are often imposed on a classification task. In medical diagnosis and marketing campaigns, it is common to have a deadline and budget for finishing the task. The objective of this paper is to develop an algorithm for inducing a classification tree with minimal misclassification cost under multiple resource constraints. To our best knowledge, the problem has not been studied in the literature. To address this problem, we propose an innovative algorithm, namely, the Cost-Sensitive Associative Tree (CAT) algorithm. Essentially, the algorithm first extracts and retains association classification rules from the training data which satisfy resource constraints, and then uses the rules to construct the final decision tree. The approach can ensure that the classification task is done within the specified resource constraints. The experiment results show that the CAT algorithm significantly outperforms the traditional top-down approach and adapts very well to available resources. | |
| dc.format.extent | 3095413 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Applied Intelligence, Vol.49, No.10, pp.3765-3872 | |
| dc.subject (關鍵詞) | Data mining ; Machine Learning ; Decision tree ; Cost-sensitive learning | |
| dc.title (題名) | Cost-Sensitive Decision Tree with Multiple Resource Constraints | |
| dc.type (資料類型) | article | |
