7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
https://doi.org/10.2316/journal.202.2011.3.202-3162
Copy DOIPublication Date: Jan 1, 2011 | |
Citations: 1 |
Regression is one of the most important tasks in real-world data mining applications. Among a large number of regression models, model tree is an excellent regression model. In this paper, we single out an improved model tree algorithm via introducing randomness into the process of building model trees. We call our improved algorithm random model trees, simply RMT. RMT firstly builds an ensemble of random model trees and then averages the predictions of these random trees to predict the target value of an unseen instance. In building each random model tree, the split is selected at random from the best k splits at each non-terminal node. We experimentally test its accuracy on the 36 benchmark datasets, and compared it with some interrelated regression models. The experimental results show that RMT significantly outperforms all the other algorithms used to compare. Our work provides an effective data mining algorithm for applications especially when high-accuracy regression is required.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.