English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54451/89232 (61%)
造访人次 : 10572293      在线人数 : 19
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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.html0KbHTML36检视/开启
    Time-constrained cost-sensitive decision tree induction.pdf664KbAdobe PDF0检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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