中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/107110
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94274/94274 (100%)
Visitors : 82915703      Online Users : 2139
RC Version 7.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


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/107110


    Title: Time-constrained cost-sensitive decision tree induction
    Authors: 陳彥良;Chen, Yen-Liang;Wu, Chia-Chi;Tang, Kwei
    Contributors: 管理學院資訊管理學系
    Keywords: Algorithms;Buildings;Classification;Cost engineering;Cost-sensitive learning;Data mining;Decision analysis;Decision tree;Decision trees;Tasks;Training;Trees
    Date: 2016-08-01
    Issue Date: 2026-04-23 13:56:49 (UTC+8)
    Publisher: Elsevier Inc.;Elsevier Inc
    Abstract: 摘要: •Cost-sensitive decision tree induction is to build a decision tree from training data with minimal cost.•No previous research has studied how to induce the minimal cost tree if the classification task has to be completed in a limited time.•This paper proposed an algorithm to induce time-constrained minimal cost tree.•The experiment results show the performance of our algorithm is very satisfactory under different time constraints. 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.
    出版者: Elsevier Inc
    出版日期: 2016-08-01
    出處: Information sciences, 2016-08, Vol.354, p.140-152
    資源來源: Elsevier ScienceDirect Journals Complete - Autoholdings
    版權: 2016 Elsevier Inc.
    識別號: ISSN: 0020-0255
    識別號: EISSN: 1872-6291
    識別號: DOI: 10.1016/j.ins.2016.03.022
    Appears in Collections:[Department of Information Management] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML15View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明