Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 1998 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 1998 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Boosting trees for cost-sensitive classifications

      Ting, Kai Ming; Zheng, Zijian
      Thumbnail
      Files
      uow-cs-wp-1998-01.pdf
      2.064Mb
      Find in your library  
      Citation
      Export citation
      Ting, K.M. & Zheng, Z. (1998). Boosting trees for cost-sensitive classifications. (Working paper 98/1). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/1046
      Abstract
      This paper explores two boosting techniques for cost-sensitive tree classification in the situation where misclassification costs change very often. Ideally, one would like to have only one induction, and use the induced model for different misclassification costs. Thus, it demands robustness of the induced model against cost changes. Combining multiple trees gives robust predictions against this change. We demonstrate that ordinary boosting combined with the minimum expected cost criterion to select the prediction class is a good solution under this situation. We also introduce a variant of the ordinary boosting procedure which utilizes the cost information during training. We show that the proposed technique performs better than the ordinary boosting in terms of misclassification cost. However, this technique requires to induce a set of new trees every time the cost changes. Our empirical investigation also reveals some interesting behavior of boosting decision trees for cost-sensitive classification.
      Date
      1998-01
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      98/1
      Publisher
      University of Waikato, Department of Computer Science
      Collections
      • 1998 Working Papers [18]
      Show full item record  

      Usage

      Downloads, last 12 months
      97
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement