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.

      Stochastic gradient trees

      Gouk, Henry; Pfahringer, Bernhard; Frank, Eibe
      Thumbnail
      Files
      gouk19a.pdf
      Published version, 267.9Kb
      Link
       proceedings.mlr.press
      Citation
      Export citation
      Gouk, H., Pfahringer, B., & Frank, E. (2019). Stochastic gradient trees. In W. S. Lee & T. Suzuki (Eds.), Proceedings of 11th Asian Conference on Machine Learning (ACML 2019) (Vol. PMLR 101, pp. 1094–1109). Nagoya, Japan: PMLR.
      Permanent Research Commons link: https://hdl.handle.net/10289/13189
      Abstract
      We present an algorithm for learning decision trees using stochastic gradient information as the source of supervision. In contrast to previous approaches to gradient-based tree learning, our method operates in the incremental learning setting rather than the batch learning setting, and does not make use of soft splits or require the construction of a new tree for every update. We demonstrate how one can apply these decision trees to different problems by changing only the loss function, using classification, regression, and multi-instance learning as example applications. In the experimental evaluation, our method performs similarly to standard incremental classification trees, outperforms state of the art incremental regression trees, and achieves comparable performance with batch multi-instance learning methods.
      Date
      2019
      Type
      Conference Contribution
      Publisher
      PMLR
      Rights
      © 2019 H. Gouk, B. Pfahringer & E. Frank.
      Collections
      • Computing and Mathematical Sciences Papers [1452]
      Show full item record  

      Usage

      Downloads, last 12 months
      12
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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