政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75527
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 114898/145937 (79%)
造訪人次 : 53962121      線上人數 : 689
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 商學院 > 企業管理學系 > 期刊論文 >  Item 140.119/75527


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/75527


    題名: Cost-sensitive decision tree induction with label-dependent late constraints
    作者: Kao, H.-P.;Tang, Kwei
    唐揆
    貢獻者: 企管系
    關鍵詞: 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
    日期: 2014
    上傳時間: 2015-06-02 17:11:07 (UTC+8)
    摘要: 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.
    關聯: INFORMS Journal on Computing, 26(2), 238-252
    資料類型: article
    DOI 連結: http://dx.doi.org/10.1287/ijoc.2013.0560
    DOI: 10.1287/ijoc.2013.0560
    顯示於類別:[企業管理學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML2983檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋