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.

      Semi-random model tree ensembles: An effective and scalable regression method

      Pfahringer, Bernhard
      DOI
       10.1007/978-3-642-25832-9_24
      Link
       www.springerlink.com
      Find in your library  
      Citation
      Export citation
      Pfahringer, B. (2011). Semi-random model tree ensembles: An effective and scalable regression method. In D.Wang & M. Reynolds (Eds.): AI 2011: Advances in Artificial Intelligence, Lecture Notes in Computer Science, 2011, Volume 7106/2011 (pp. 231-240). Springer-Verlag Berlin Heidelberg.
      Permanent Research Commons link: https://hdl.handle.net/10289/6372
      Abstract
      We present and investigate ensembles of semi-random model trees as a novel regression method. Such ensembles combine the scalability of tree-based methods with predictive performance rivalling the state of the art in numeric prediction. An empirical investigation shows that Semi-Random Model Trees produce predictive performance which is competitive with state-of-the-art methods like Gaussian Processes Regression or Additive Groves of Regression Trees. The training and optimization of Random Model Trees scales better than Gaussian Processes Regression to larger datasets, and enjoys a constant advantage over Additive Groves of the order of one to two orders of magnitude.
      Date
      2011
      Type
      Conference Contribution
      Publisher
      Springer
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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