English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 56804/90523 (63%)
造訪人次 : 12092905      線上人數 : 155
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/118997

    題名: Cost-sensitive decision tree with multiple resource constraints
    作者: Wu, Chia-Chi;Chen, Yen-Liang;Tang, Kwei
    關鍵詞: Data mining;Machine Learning;Decision tree;Cost-sensitive learning
    日期: 2019-10
    上傳時間: 2020-07-28 12:10:37 (UTC+8)
    出版者: Springer New York LLC
    摘要: 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.
    關聯: Applied Intelligence 49, p.3765-3782
    顯示於類別:[管理科學學系暨研究所] 期刊論文


    檔案 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋