adding more to decision trees

2019-12-12 16:56:49 +01:00
parent ed4bf0de50
commit 47d27e2663
10 changed files with 54 additions and 6 deletions
@@ -299,7 +299,7 @@ MathJax.Hub.Config({
 <center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
 <br>
 <p>
-<center><h4>Dec 9, 2019</h4></center> <!-- date -->
+<center><h4>Dec 12, 2019</h4></center> <!-- date -->
 <br>
 <p>

@@ -285,6 +285,14 @@ MathJax.Hub.Config({
 <p>
 Here we present <a href="https://pdfs.semanticscholar.org/8d49/e2dedb817f2c3330e74b63c5fc86d2399ce3.pdf" target="_self">Drucker's AdaBoost</a> tailored for regression.

+<p>
+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.
+
 <p>
 <p>
 <!-- navigation buttons at the bottom of the page -->
@@ -299,7 +299,7 @@ MathJax.Hub.Config({
 <center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
 <br>
 <p>
-<center><h4>Dec 9, 2019</h4></center> <!-- date -->
+<center><h4>Dec 12, 2019</h4></center> <!-- date -->
 <br>
 <p>

@@ -148,7 +148,7 @@ MathJax.Hub.Config({
 <center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
 <br>
 <p>&nbsp;<br>
-<center><h4>Dec 9, 2019</h4></center> <!-- date -->
+<center><h4>Dec 12, 2019</h4></center> <!-- date -->
 <br>
 <p>

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

 <p>
 Here we present <a href="https://pdfs.semanticscholar.org/8d49/e2dedb817f2c3330e74b63c5fc86d2399ce3.pdf" target="_blank">Drucker's AdaBoost</a> tailored for regression.
+
+<p>
+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.
 </section>


@@ -224,7 +224,7 @@ MathJax.Hub.Config({
 <center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
 <br>
 <p>
-<center><h4>Dec 9, 2019</h4></center> <!-- date -->
+<center><h4>Dec 12, 2019</h4></center> <!-- date -->
 <br>
 <p>
 <!-- !split --><br><br><br><br><br><br><br><br><br><br>
@@ -2386,6 +2386,14 @@ plt.show()
 <p>
 Here we present <a href="https://pdfs.semanticscholar.org/8d49/e2dedb817f2c3330e74b63c5fc86d2399ce3.pdf" target="_blank">Drucker's AdaBoost</a> tailored for regression.

+<p>
+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.
+
 <p>
 <!-- !split --><br><br><br><br><br><br><br><br><br><br>

@@ -229,7 +229,7 @@ MathJax.Hub.Config({
 <center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
 <br>
 <p>
-<center><h4>Dec 9, 2019</h4></center> <!-- date -->
+<center><h4>Dec 12, 2019</h4></center> <!-- date -->
 <br>
 <p>
 <!-- !split --><br><br><br><br><br><br><br><br><br><br>
@@ -2391,6 +2391,14 @@ plt<span style="color: #666666">.</span>show()
 <p>
 Here we present <a href="https://pdfs.semanticscholar.org/8d49/e2dedb817f2c3330e74b63c5fc86d2399ce3.pdf" target="_blank">Drucker's AdaBoost</a> tailored for regression.

+<p>
+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.
+
 <p>
 <!-- !split --><br><br><br><br><br><br><br><br><br><br>

@@ -10,7 +10,7 @@
    "<!-- Author: -->  \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",
@@ -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 =====