typo in decision tree

2019-12-06 09:15:09 +01:00
parent 6a7f015f11
commit 5743bb6c91
8 changed files with 6 additions and 6 deletions
@@ -282,7 +282,7 @@ MathJax.Hub.Config({
 The algorithm described here can be applied to both classification and regression problems.

 <p>
-We will grow of forest of say \( M \) trees.
+We will grow of forest of say \( B \) trees.

 <ol>
 <li> For \( b=1:B \)</li>
@@ -1900,7 +1900,7 @@ this setting.
 The algorithm described here can be applied to both classification and regression problems.

 <p>
-We will grow of forest of say \( M \) trees.
+We will grow of forest of say \( B \) trees.

 <ol>
 <p><li> For \( b=1:B \)</li>
@@ -1919,7 +1919,7 @@ this setting.
 The algorithm described here can be applied to both classification and regression problems.

 <p>
-We will grow of forest of say \( M \) trees.
+We will grow of forest of say \( B \) trees.

 <ol>
 <li> For \( b=1:B \)</li>
@@ -1924,7 +1924,7 @@ this setting.
 The algorithm described here can be applied to both classification and regression problems.

 <p>
-We will grow of forest of say \( M \) trees.
+We will grow of forest of say \( B \) trees.

 <ol>
 <li> For \( b=1:B \)</li>
@@ -1952,7 +1952,7 @@
    "## Random Forest Algorithm\n",
    "The algorithm described here can be applied to both classification and regression problems.\n",
    "\n",
-    "We will grow of forest of say $M$ trees.\n",
+    "We will grow of forest of say $B$ trees.\n",
    "1. For $b=1:B$\n",
    "\n",
    "  * Draw a bootstrap sample of from the training data organized in our $\\boldsymbol{X}$ matrix.\n",
@@ -1559,7 +1559,7 @@ this setting.
 ===== Random Forest Algorithm =====
 The algorithm described here can be applied to both classification and regression problems.

-We will grow of forest of say $M$ trees.
+We will grow of forest of say $B$ trees.
 o For $b=1:B$
  * Draw a bootstrap sample of from the training data organized in our $\bm{X}$ matrix.
  * We grow then a random forest tree $T_b$ based on the bootstrapped data by repeating the steps outlined till we reach the maximum node size is reached