diff --git a/doc/pub/DecisionTrees/html/._DecisionTrees-bs000.html b/doc/pub/DecisionTrees/html/._DecisionTrees-bs000.html index a8af4039e..b0e52796d 100644 --- a/doc/pub/DecisionTrees/html/._DecisionTrees-bs000.html +++ b/doc/pub/DecisionTrees/html/._DecisionTrees-bs000.html @@ -299,7 +299,7 @@ MathJax.Hub.Config({
[2] Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University

-

Dec 9, 2019

+

Dec 12, 2019


diff --git a/doc/pub/DecisionTrees/html/._DecisionTrees-bs055.html b/doc/pub/DecisionTrees/html/._DecisionTrees-bs055.html index a09bcd60f..8d3597dbb 100644 --- a/doc/pub/DecisionTrees/html/._DecisionTrees-bs055.html +++ b/doc/pub/DecisionTrees/html/._DecisionTrees-bs055.html @@ -285,6 +285,14 @@ MathJax.Hub.Config({

Here we present Drucker's AdaBoost 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. +

diff --git a/doc/pub/DecisionTrees/html/DecisionTrees-bs.html b/doc/pub/DecisionTrees/html/DecisionTrees-bs.html index a8af4039e..b0e52796d 100644 --- a/doc/pub/DecisionTrees/html/DecisionTrees-bs.html +++ b/doc/pub/DecisionTrees/html/DecisionTrees-bs.html @@ -299,7 +299,7 @@ MathJax.Hub.Config({

[2] Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University

-

Dec 9, 2019

+

Dec 12, 2019


diff --git a/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html b/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html index 187dd267c..8e8a5e858 100644 --- a/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html +++ b/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html @@ -148,7 +148,7 @@ MathJax.Hub.Config({

[2] Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University

 
-

Dec 9, 2019

+

Dec 12, 2019


@@ -2421,6 +2421,14 @@ plt.show()

Here we present Drucker's AdaBoost 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. diff --git a/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html b/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html index c6444e181..473793572 100644 --- a/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html +++ b/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html @@ -224,7 +224,7 @@ MathJax.Hub.Config({

[2] Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University

-

Dec 9, 2019

+

Dec 12, 2019












@@ -2386,6 +2386,14 @@ plt.show()

Here we present Drucker's AdaBoost 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. +











diff --git a/doc/pub/DecisionTrees/html/DecisionTrees.html b/doc/pub/DecisionTrees/html/DecisionTrees.html index d271815c7..75a2c342c 100644 --- a/doc/pub/DecisionTrees/html/DecisionTrees.html +++ b/doc/pub/DecisionTrees/html/DecisionTrees.html @@ -229,7 +229,7 @@ MathJax.Hub.Config({

[2] Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University

-

Dec 9, 2019

+

Dec 12, 2019












@@ -2391,6 +2391,14 @@ plt.show()

Here we present Drucker's AdaBoost 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. +











diff --git a/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb b/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb index b2cee49eb..d2132da47 100644 --- a/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb +++ b/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb @@ -10,7 +10,7 @@ " \n", "**Morten Hjorth-Jensen**, Department of Physics, University of Oslo and Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University\n", "\n", - "Date: **Dec 9, 2019**\n", + "Date: **Dec 12, 2019**\n", "\n", "Copyright 1999-2019, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license\n", "\n", @@ -2650,6 +2650,14 @@ "\n", "Here we present [Drucker's AdaBoost](https://pdfs.semanticscholar.org/8d49/e2dedb817f2c3330e74b63c5fc86d2399ce3.pdf) tailored for regression.\n", "\n", + "In bagging, each training example is equally likely to be\n", + "picked. In boosting, the probability of a particular\n", + "example being in the training set of a particular machine\n", + "depends on the performance of the prior machines on\n", + "that example. The following is a modification of\n", + "Adaboost by Drucker.\n", + "\n", + "\n", "## Gradient boosting: Basics with Steepest Descent\n", "\n", "Gradient boosting is again a similar technique to Adaptive boosting,\n", diff --git a/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz b/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz index cf1b50002..3f00ab617 100644 Binary files a/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz and b/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz differ diff --git a/doc/pub/DecisionTrees/pdf/DecisionTrees-minted.pdf b/doc/pub/DecisionTrees/pdf/DecisionTrees-minted.pdf index cc7d78e47..fae007777 100644 Binary files a/doc/pub/DecisionTrees/pdf/DecisionTrees-minted.pdf and b/doc/pub/DecisionTrees/pdf/DecisionTrees-minted.pdf differ diff --git a/doc/src/DecisionTrees/DecisionTrees.do.txt b/doc/src/DecisionTrees/DecisionTrees.do.txt index 1b2c3f11e..af97ea702 100644 --- a/doc/src/DecisionTrees/DecisionTrees.do.txt +++ b/doc/src/DecisionTrees/DecisionTrees.do.txt @@ -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 =====