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.

      Alternating model trees

      Frank, Eibe; Mayo, Michael; Kramer, Stefan
      Thumbnail
      Files
      alternating_model_trees_sac.pdf
      Submitted version, 330.2Kb
      DOI
       10.1145/2695664.2695848
      Find in your library  
      Citation
      Export citation
      Frank, E., Mayo, M., & Kramer, S. (2015). Alternating model trees. In Proc 30th ACM Symposium on Applied Computing, Data Mining Track. Salamanca, Spain: ACM Press.
      Permanent Research Commons link: https://hdl.handle.net/10289/9398
      Abstract
      Model tree induction is a popular method for tackling regression problems requiring interpretable models. Model trees are decision trees with multiple linear regression models at the leaf nodes. In this paper, we propose a method for growing alternating model trees, a form of option tree for regression problems. The motivation is that alternating decision trees achieve high accuracy in classification problems because they represent an ensemble classifier as a single tree structure. As in alternating decision trees for classifi-cation, our alternating model trees for regression contain splitter and prediction nodes, but we use simple linear regression functions as opposed to constant predictors at the prediction nodes. Moreover, additive regression using forward stagewise modeling is applied to grow the tree rather than a boosting algorithm. The size of the tree is determined using cross-validation. Our empirical results show that alternating model trees achieve significantly lower squared error than standard model trees on several regression datasets.
      Date
      2015
      Type
      Conference Contribution
      Publisher
      ACM Press
      Rights
      This is an author’s accepted version of an article in Proceedings of 38th Annual ACM SIGIR conference, Santiago de Chile, Chile. © 2015 ACM.
      Collections
      • Computing and Mathematical Sciences Papers [1445]
      Show full item record  

      Usage

      Downloads, last 12 months
      106
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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