Scholarlink

<p>Gradient Boosting Trees (GBT) is a powerful machine learning technique that is based on ensemble learning methods that leverage the idea of boosting. GBT combines multiple weak learners sequentially to boost its prediction power proving its outstanding efficiency in many problems, and hence it is now considered one of the top techniques used to solve prediction problems. In this paper, a hybrid approach is proposed that combines GBT with K-means and Bisecting K-means clustering to enhance the predictive power of the approach on regression datasets. The proposed approach is applied on 40 regression datasets from UCI and Kaggle websites and it achieves better efficiency than using only one GBT model. Statistical tests are applied, namely, Friedman and Wilcoxon signed-rank tests showing that the proposed approach achieves significant better results than using only one GBT model.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Enhancing the performance of gradient boosting trees on regression problems

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年2月17日

查看全文
  • Lydia Wahid Rizkallah

摘要

Gradient Boosting Trees (GBT) is a powerful machine learning technique that is based on ensemble learning methods that leverage the idea of boosting. GBT combines multiple weak learners sequentially to boost its prediction power proving its outstanding efficiency in many problems, and hence it is now considered one of the top techniques used to solve prediction problems. In this paper, a hybrid approach is proposed that combines GBT with K-means and Bisecting K-means clustering to enhance the predictive power of the approach on regression datasets. The proposed approach is applied on 40 regression datasets from UCI and Kaggle websites and it achieves better efficiency than using only one GBT model. Statistical tests are applied, namely, Friedman and Wilcoxon signed-rank tests showing that the proposed approach achieves significant better results than using only one GBT model.