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
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Ensembles of nested dichotomies with multiple subset evaluation

      Leathart, Tim; Frank, Eibe; Pfahringer, Bernhard; Holmes, Geoffrey
      Thumbnail
      Files
      multisubset.pdf
      Accepted version, 419.1Kb
      DOI
       10.1007/978-3-030-16148-4_7
      Find in your library  
      Citation
      Export citation
      Leathart, T., Frank, E., Pfahringer, B., & Holmes, G. (2019). Ensembles of nested dichotomies with multiple subset evaluation. In Q. Yang, Z.-H. Zhou, Z. Gong, M.-L. Zhang, & S.-J. Huang (Eds.), Advances in Knowledge Discovery and Data Mining: Proc 23rd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2019), LNCS 11439 (Vol. Part I, pp. 81–93). Cham: Springer. https://doi.org/10.1007/978-3-030-16148-4_7
      Permanent Research Commons link: https://hdl.handle.net/10289/12597
      Abstract
      A system of nested dichotomies (NDs) is a method of decomposing a multiclass problem into a collection of binary problems. Such a system recursively applies binary splits to divide the set of classes into two subsets, and trains a binary classifier for each split. Many methods have been proposed to perform this split, each with various advantages and disadvantages. In this paper, we present a simple, general method for improving the predictive performance of NDs produced by any subset selection techniques that employ randomness to construct the subsets. We provide a theoretical expectation for performance improvements, as well as empirical results showing that our method improves the root mean squared error of NDs, regardless of whether they are employed as an individual model or in an ensemble setting.
      Date
      2019
      Type
      Conference Contribution
      Publisher
      Springer
      Rights
      © 2019 Springer, Cham. This is the author's accepted version. The final publication is available at Springer via dx.doi.org/10.1007/978-3-030-16148-4_7
      Collections
      • Computing and Mathematical Sciences Papers [1452]
      Show full item record  

      Usage

      Downloads, last 12 months
      90
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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