forgot to generate files for CART algorithm

doc/pub/DecisionTrees/html/._DecisionTrees-bs018.html

@@ -292,7 +292,7 @@ $$
 C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}}}{m}G_{\mathrm{right}},
 $$
 
-where \( G_{\mathrm{left\left}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
+where \( G_{\mathrm{left/right}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
  is the number of instances in the left/right subset
 
 <p>

doc/pub/DecisionTrees/html/DecisionTrees-reveal.html

@@ -732,7 +732,7 @@ C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}
 $$
 <p>&nbsp;<br>
 
-where \( G_{\mathrm{left\left}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
+where \( G_{\mathrm{left/right}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
  is the number of instances in the left/right subset
 
 <p>

doc/pub/DecisionTrees/html/DecisionTrees-solarized.html

@@ -777,7 +777,7 @@ $$
 C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}}}{m}G_{\mathrm{right}},
 $$
 
-where \( G_{\mathrm{left\left}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
+where \( G_{\mathrm{left/right}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
  is the number of instances in the left/right subset
 
 <p>

doc/pub/DecisionTrees/html/DecisionTrees.html

@@ -782,7 +782,7 @@ $$
 C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}}}{m}G_{\mathrm{right}},
 $$
 
-where \( G_{\mathrm{left\left}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
+where \( G_{\mathrm{left/right}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
  is the number of instances in the left/right subset
 
 <p>

doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb

@@ -637,7 +637,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "where $G_{\\mathrm{left\\left}}$ measures the impurity of the left/right subset  and $m_{\\mathrm{left/right}}$\n",
+    "where $G_{\\mathrm{left/right}}$ measures the impurity of the left/right subset  and $m_{\\mathrm{left/right}}$\n",
     " is the number of instances in the left/right subset\n",
     "\n",
     "Once it has successfully split the training set in two, it splits the subsets using the same logic, then the subsubsets\n",

doc/src/DecisionTrees/DecisionTrees.do.txt

@@ -490,7 +490,7 @@ The cost function it tries to minimize is then
 C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}}}{m}G_{\mathrm{right}},
 \]
 !et
-where $G_{\mathrm{left\left}}$ measures the impurity of the left/right subset  and $m_{\mathrm{left/right}}$
+where $G_{\mathrm{left/right}}$ measures the impurity of the left/right subset  and $m_{\mathrm{left/right}}$
  is the number of instances in the left/right subset
 
 Once it has successfully split the training set in two, it splits the subsets using the same logic, then the subsubsets