Advanced Search
MyIDEAS: Login to save this paper or follow this series

Cost-Sensitive Decision Trees with Completion Time Requirements


Author Info

  • Hung-Pin KAO
  • Kwei TANG
  • Jen TANG
Registered author(s):


    In many classification tasks, managing costs and completion times are the main concerns. In this paper, we assume that the completion time for classifying an instance is determined by its class label, and that a late penalty cost is incurred if the deadline is not met. This time requirement enriches the classification problem but posts a challenge to developing a solution algorithm. We propose an innovative approach for the decision tree induction, which produces multiple candidate trees by allowing more than one splitting attribute at each node. The user can specify the maximum number of candidate trees to control the computational efforts required to produce the final solution. In the tree-induction process, an allocation scheme is used to dynamically distribute the given number of candidate trees to splitting attributes according to their estimated contributions to cost reduction. The algorithm finds the final tree by backtracking. An extensive experiment shows that the algorithm outperforms the top-down heuristic and can effectively obtain the optimal or near-optimal decision trees without an excessive computation time.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Krannert PHD)
    Download Restriction: no

    Bibliographic Info

    Paper provided by Purdue University, Department of Economics in its series Purdue University Economics Working Papers with number 1264.

    as in new window
    Length: 14 pages
    Date of creation: Sep 2010
    Date of revision:
    Handle: RePEc:pur:prukra:1264

    Contact details of provider:
    Postal: Krannert Building, West Lafayette, IN 47907
    Web page:
    More information through EDIRC

    Related research

    Keywords: classification; decision tree; cost and time sensitive learning; late penalty;

    This paper has been announced in the following NEP Reports:


    No references listed on IDEAS
    You can help add them by filling out this form.



    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:pur:prukra:1264. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Krannert PHD).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.