Augboost: Gradient boosting enhanced with step-wise feature augmentation

15Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Gradient Boosted Decision Trees (GBDT) is a widely used machine learning algorithm, which obtains state-of-the-art results on many machine learning tasks. In this paper we introduce a method for obtaining better results, by augmenting the features in the dataset between the iterations of GBDT. We explore a number of augmentation methods: training an Artificial Neural Network (ANN) and extracting features from it's last hidden layer (supervised), and rotating the feature-space using unsupervised methods such as PCA or Random Projection (RP). These variations on GBDT were tested on 20 classification tasks, on which all of them outperformed GBDT and previous related work.

Cite

CITATION STYLE

APA

Tannor, P., & Rokach, L. (2019). Augboost: Gradient boosting enhanced with step-wise feature augmentation. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2019-August, pp. 3555–3561). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2019/493

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free