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

Authors:
Bernhard Pfahringer
Affiliations:
University of Waikato, New Zealand
Venue:
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Year:
2011

Citing 8
Cited 0

Simplifying decision trees

International Journal of Man-Machine Studies - Special Issue: Knowledge Acquisition for Knowledge-based Systems. Part 5
Bagging predictors

Machine Learning
Random Forests

Machine Learning
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
A general framework for accurate and fast regression by data summarization in random decision trees

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)

Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)
Additive Groves of Regression Trees

ECML '07 Proceedings of the 18th European conference on Machine Learning
The WEKA data mining software: an update

ACM SIGKDD Explorations Newsletter

Quantified Score

Hi-index	0.00

Visualization

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.