政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75527

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113648/144635 (79%)
Visitors : 51621560 Online Users : 506

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 商學院 > 企業管理學系 > 期刊論文 > Item 140.119/75527

Please use this identifier to cite or link to this item: https://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	Size	Format
index.html		0Kb	HTML2	940	View/Open

社群 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.

Loading...