adding more to decision trees

This commit is contained in:
mhjensen
2019-12-12 16:56:49 +01:00
parent ed4bf0de50
commit 47d27e2663
10 changed files with 54 additions and 6 deletions
@@ -1995,6 +1995,14 @@ plt.show()
Here we present "Drucker's AdaBoost":"https://pdfs.semanticscholar.org/8d49/e2dedb817f2c3330e74b63c5fc86d2399ce3.pdf" tailored for regression.
In bagging, each training example is equally likely to be
picked. In boosting, the probability of a particular
example being in the training set of a particular machine
depends on the performance of the prior machines on
that example. The following is a modification of
Adaboost by Drucker.
!split
===== Gradient boosting: Basics with Steepest Descent =====