English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94524/125052 (76%)
Visitors : 29727597      Online Users : 236
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 企業管理學系 > 期刊論文 >  Item 140.119/75527
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/75527

    Title: Cost-sensitive decision tree induction with label-dependent late constraints
    Authors: Kao, H.-P.;Tang, Kwei
    Contributors: 企管系
    Keywords: Algorithms;Classification (of information);Costs;Decision trees;Diagnosis;Iterative methods;Classification tasks;Classification time;Constrained data mining;Conventional approach;Decision tree induction;Near-optimal solutions;Numerical experiments;Solution algorithms;Data mining
    Date: 2014
    Issue Date: 2015-06-02 17:11:07 (UTC+8)
    Abstract: Completion time requirements are often imposed on a classification task. In practice, the desired completion time for classifying a subject may depend on its label (target) value. For example, a timely diagnosis is important for an illness that requires immediate medical attention. It is common in medical diagnoses, therefore, to set completion times based on the severity level of the illness. In this study, we use "label-dependent" completion time requirements to formulate a new classification problem for cost-sensitive decision tree induction by adding "late constraints" to control the rate of tardy classifications for each label value. Adding the late constraints generalizes and enriches the decision tree induction problem, but also poses a challenge to developing an efficient solution algorithm because the conventional approach based on the "divide-and-conquer" strategy cannot be used. We develop a novel algorithm that relaxes the late constraints and iteratively solves a series of cost-sensitive decision tree problems under systematically-generated late penalties. The results of an extensive numerical experiment show that the proposed algorithm is effective in finding the optimal or a near-optimal solution. © 2014 INFORMS.
    Relation: INFORMS Journal on Computing, 26(2), 238-252
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1287/ijoc.2013.0560
    DOI: 10.1287/ijoc.2013.0560
    Appears in Collections:[企業管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback