finished adaboost also
This commit is contained in:
mhjensen
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -259,7 +266,7 @@ MathJax.Hub.Config({
|
||||
<li><a href="._DecisionTrees-bs008.html">9</a></li>
|
||||
<li><a href="._DecisionTrees-bs009.html">10</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs001.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -264,7 +271,7 @@ given some assumptions, make predictions about the target feature value
|
||||
<li><a href="._DecisionTrees-bs009.html">10</a></li>
|
||||
<li><a href="._DecisionTrees-bs010.html">11</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs002.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -242,7 +249,7 @@ This tree was produced using the Wisconsin cancer data (discussed here as well,
|
||||
<li><a href="._DecisionTrees-bs010.html">11</a></li>
|
||||
<li><a href="._DecisionTrees-bs011.html">12</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs003.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -250,7 +257,7 @@ node.
|
||||
<li><a href="._DecisionTrees-bs011.html">12</a></li>
|
||||
<li><a href="._DecisionTrees-bs012.html">13</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs004.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -251,7 +258,7 @@ Then we are essentially done!
|
||||
<li><a href="._DecisionTrees-bs012.html">13</a></li>
|
||||
<li><a href="._DecisionTrees-bs013.html">14</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs005.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -330,7 +337,7 @@ plt<span style="color: #666666">.</span>show()
|
||||
<li><a href="._DecisionTrees-bs013.html">14</a></li>
|
||||
<li><a href="._DecisionTrees-bs014.html">15</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs006.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -263,7 +270,7 @@ within box \( j \).
|
||||
<li><a href="._DecisionTrees-bs014.html">15</a></li>
|
||||
<li><a href="._DecisionTrees-bs015.html">16</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs007.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -255,7 +262,7 @@ better tree in some future step.
|
||||
<li><a href="._DecisionTrees-bs015.html">16</a></li>
|
||||
<li><a href="._DecisionTrees-bs016.html">17</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs008.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -288,7 +295,7 @@ region contains more than five observations.
|
||||
<li><a href="._DecisionTrees-bs016.html">17</a></li>
|
||||
<li><a href="._DecisionTrees-bs017.html">18</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs009.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -257,7 +264,7 @@ parameter \( \alpha \).
|
||||
<li><a href="._DecisionTrees-bs017.html">18</a></li>
|
||||
<li><a href="._DecisionTrees-bs018.html">19</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs010.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -270,7 +277,7 @@ subtree corresponding to \( \alpha \).
|
||||
<li><a href="._DecisionTrees-bs018.html">19</a></li>
|
||||
<li><a href="._DecisionTrees-bs019.html">20</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs011.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -266,7 +273,7 @@ MathJax.Hub.Config({
|
||||
<li><a href="._DecisionTrees-bs019.html">20</a></li>
|
||||
<li><a href="._DecisionTrees-bs020.html">21</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs012.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -258,7 +265,7 @@ fall into that region.
|
||||
<li><a href="._DecisionTrees-bs020.html">21</a></li>
|
||||
<li><a href="._DecisionTrees-bs021.html">22</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs013.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -263,7 +270,7 @@ than is the classification error rate.
|
||||
<li><a href="._DecisionTrees-bs021.html">22</a></li>
|
||||
<li><a href="._DecisionTrees-bs022.html">23</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs014.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -289,7 +296,7 @@ $$
|
||||
<li><a href="._DecisionTrees-bs022.html">23</a></li>
|
||||
<li><a href="._DecisionTrees-bs023.html">24</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs015.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -280,7 +287,7 @@ os<span style="color: #666666">.</span>system(cmd)
|
||||
<li><a href="._DecisionTrees-bs023.html">24</a></li>
|
||||
<li><a href="._DecisionTrees-bs024.html">25</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs016.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -271,7 +278,7 @@ os<span style="color: #666666">.</span>system(cmd)
|
||||
<li><a href="._DecisionTrees-bs024.html">25</a></li>
|
||||
<li><a href="._DecisionTrees-bs025.html">26</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs017.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -252,7 +259,7 @@ We discuss both algorithms with applications here. The popular library -Scikit-L
|
||||
<li><a href="._DecisionTrees-bs025.html">26</a></li>
|
||||
<li><a href="._DecisionTrees-bs026.html">27</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs018.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -244,7 +251,7 @@ MathJax.Hub.Config({
|
||||
<li><a href="._DecisionTrees-bs026.html">27</a></li>
|
||||
<li><a href="._DecisionTrees-bs027.html">28</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs019.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -244,7 +251,7 @@ MathJax.Hub.Config({
|
||||
<li><a href="._DecisionTrees-bs027.html">28</a></li>
|
||||
<li><a href="._DecisionTrees-bs028.html">29</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs020.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -284,7 +291,7 @@ The table here summarizes the various attributes and
|
||||
<li><a href="._DecisionTrees-bs028.html">29</a></li>
|
||||
<li><a href="._DecisionTrees-bs029.html">30</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs021.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -315,7 +322,7 @@ os<span style="color: #666666">.</span>system(cmd)
|
||||
<li><a href="._DecisionTrees-bs029.html">30</a></li>
|
||||
<li><a href="._DecisionTrees-bs030.html">31</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs022.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -317,7 +324,7 @@ split <span style="color: #666666">=</span> get_split(dataset)
|
||||
<li><a href="._DecisionTrees-bs030.html">31</a></li>
|
||||
<li><a href="._DecisionTrees-bs031.html">32</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs023.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -275,7 +282,7 @@ attributes at each step while growing the tree.
|
||||
<li><a href="._DecisionTrees-bs031.html">32</a></li>
|
||||
<li><a href="._DecisionTrees-bs032.html">33</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs024.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -435,7 +442,7 @@ MathJax.Hub.Config({
|
||||
<li><a href="._DecisionTrees-bs032.html">33</a></li>
|
||||
<li><a href="._DecisionTrees-bs033.html">34</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs025.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -288,7 +295,7 @@ deep_tree_clf<span style="color: #666666">.</span>fit(X_train_scaled, y_train)
|
||||
<li><a href="._DecisionTrees-bs033.html">34</a></li>
|
||||
<li><a href="._DecisionTrees-bs034.html">35</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs026.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -311,7 +318,7 @@ plt<span style="color: #666666">.</span>show()
|
||||
<li><a href="._DecisionTrees-bs034.html">35</a></li>
|
||||
<li><a href="._DecisionTrees-bs035.html">36</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs027.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -267,7 +274,7 @@ plt<span style="color: #666666">.</span>show()
|
||||
<li><a href="._DecisionTrees-bs035.html">36</a></li>
|
||||
<li><a href="._DecisionTrees-bs036.html">37</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs028.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -261,7 +268,7 @@ tree_reg<span style="color: #666666">.</span>fit(X, y)
|
||||
<li><a href="._DecisionTrees-bs036.html">37</a></li>
|
||||
<li><a href="._DecisionTrees-bs037.html">38</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs029.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -317,7 +324,7 @@ plt<span style="color: #666666">.</span>show()
|
||||
<li><a href="._DecisionTrees-bs037.html">38</a></li>
|
||||
<li><a href="._DecisionTrees-bs038.html">39</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs030.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -253,7 +260,7 @@ MathJax.Hub.Config({
|
||||
<li><a href="._DecisionTrees-bs038.html">39</a></li>
|
||||
<li><a href="._DecisionTrees-bs039.html">40</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs031.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -256,7 +263,7 @@ However, by aggregating many decision trees, using methods like bagging, random
|
||||
<li><a href="._DecisionTrees-bs039.html">40</a></li>
|
||||
<li><a href="._DecisionTrees-bs040.html">41</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs032.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -263,7 +270,7 @@ We discuss these methods here.
|
||||
<li><a href="._DecisionTrees-bs040.html">41</a></li>
|
||||
<li><a href="._DecisionTrees-bs041.html">42</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs033.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -258,7 +265,7 @@ learning method.
|
||||
<li><a href="._DecisionTrees-bs041.html">42</a></li>
|
||||
<li><a href="._DecisionTrees-bs042.html">43</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs034.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -268,7 +275,7 @@ predictor, averaged over all \( B \) trees.
|
||||
<li><a href="._DecisionTrees-bs042.html">43</a></li>
|
||||
<li><a href="._DecisionTrees-bs043.html">44</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs035.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -259,7 +266,7 @@ plt<span style="color: #666666">.</span>show()
|
||||
<li><a href="._DecisionTrees-bs043.html">44</a></li>
|
||||
<li><a href="._DecisionTrees-bs044.html">45</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs036.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -290,7 +297,7 @@ voting_clf<span style="color: #666666">.</span>fit(X_train, y_train)
|
||||
<li><a href="._DecisionTrees-bs044.html">45</a></li>
|
||||
<li><a href="._DecisionTrees-bs045.html">46</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs037.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -297,7 +304,7 @@ voting_clf<span style="color: #666666">.</span>fit(X_train, y_train)
|
||||
<li><a href="._DecisionTrees-bs045.html">46</a></li>
|
||||
<li><a href="._DecisionTrees-bs046.html">47</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs038.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -300,7 +307,7 @@ plt<span style="color: #666666">.</span>show()
|
||||
<li><a href="._DecisionTrees-bs046.html">47</a></li>
|
||||
<li><a href="._DecisionTrees-bs047.html">48</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs039.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -100,20 +100,25 @@ Automatically generated HTML file from DocOnce source
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -190,17 +195,19 @@ MathJax.Hub.Config({
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">A simple scikit-learn example</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Then random forests</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basic Algorithm</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
|
||||
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
|
||||
|
||||
</ul>
|
||||
</li>
|
||||
@@ -259,7 +266,7 @@ MathJax.Hub.Config({
|
||||
<li><a href="._DecisionTrees-bs008.html">9</a></li>
|
||||
<li><a href="._DecisionTrees-bs009.html">10</a></li>
|
||||
<li><a href="">...</a></li>
|
||||
<li><a href="._DecisionTrees-bs050.html">51</a></li>
|
||||
<li><a href="._DecisionTrees-bs052.html">53</a></li>
|
||||
<li><a href="._DecisionTrees-bs001.html">»</a></li>
|
||||
</ul>
|
||||
<!-- ------------------- end of main content --------------- -->
|
||||
|
||||
@@ -1752,7 +1752,13 @@ this setting.
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec39">A simple scikit-learn example </h2>
|
||||
<h2 id="___sec39">Random Forest Algorithm </h2>
|
||||
The algorithm described here can be applied to both classification and regression problems.
|
||||
</section>
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec40">A simple scikit-learn example </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -1771,7 +1777,7 @@ accuracy = cross_validate(Random_Forest_model,X,Y,cv=<span style="color: #B452CD
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec40">Then random forests </h2>
|
||||
<h2 id="___sec41">Then random forests </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -1794,7 +1800,7 @@ np.sum(y_pred == y_pred_rf) / <span style="color: #658b00">len</span>(y_pred)
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec41">Feature Importance </h2>
|
||||
<h2 id="___sec42">Feature Importance </h2>
|
||||
|
||||
<p>
|
||||
Example will be added here.
|
||||
@@ -1802,7 +1808,7 @@ Example will be added here.
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec42">Boosting, a Bird'e Eye </h2>
|
||||
<h2 id="___sec43">Boosting, a Bird'e Eye </h2>
|
||||
|
||||
<p>
|
||||
The basic idea is to combine weak classifiers in order to create a good
|
||||
@@ -1819,7 +1825,7 @@ them with a factor.
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec43">Adaptive boosting: AdaBoost, Basic Algorithm </h2>
|
||||
<h2 id="___sec44">Adaptive boosting: AdaBoost, Basic Algorithm </h2>
|
||||
|
||||
<p>
|
||||
The algorithm here is rather straightforward. Assume that our weak
|
||||
@@ -1843,7 +1849,7 @@ where the function \( I() \) is one if we misclassify and zero if we classify co
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec44">Basic Steps of AdaBoost </h2>
|
||||
<h2 id="___sec45">Basic Steps of AdaBoost </h2>
|
||||
|
||||
<p>
|
||||
With the above definitions we are now ready to set up the algorithm for AdaBoost.
|
||||
@@ -1858,11 +1864,42 @@ $$
|
||||
\mathrm{err}=\frac{\sum_{i=0}^{n-1}w_iI(y_i\ne G(\boldsymbol{X}_{i*})}{\sum_{i=0}^{n-1}w_i},
|
||||
$$
|
||||
<p> <br>
|
||||
|
||||
|
||||
<ol>
|
||||
<p><li> Then we start looping over all attempts at classifying, namely we start an iterative process for \( m=1:M \), where \( M \) is the final number of classifications. Our given classifier could for example be a plain decision tree.
|
||||
|
||||
<ol type="a"></li>
|
||||
<p><li> Fit thus a given classifier to the training using the weights \( w_i \).</li>
|
||||
<p><li> Compute then \( \mathrm{err} \) and figure out which events are classified properly and which are classified wrongly.</li>
|
||||
<p><li> Define a quantity $\alpha_{m} = \log{(1-\mathrm{err})/\mathrm{err}}</li>
|
||||
<p><li> Set the new weights to $w_i = w_i\times \exp{(\alpha_m I(y_i\ne G(\boldsymbol{X}_{i*})}.</li>
|
||||
</ol>
|
||||
<p><li> Compute the new classifier $G(\boldsymbol{X})= \sum_{i=0}^{n-1}\alpha_m I(y_i\ne G(\boldsymbol{X}_{i*}).</li>
|
||||
</ol>
|
||||
<p>
|
||||
|
||||
For the iterations with \( m \le 2 \) the weights are modified
|
||||
individually at each steps. The obersvations which were misclassified
|
||||
at iteration \( m-1 \) have a weight which is larger than those which were
|
||||
classified properly. As this proceeds, the observations which were
|
||||
difficult to classifiy correctly are given a larger influence. Each
|
||||
new classificatio step \( m \) is then forced to concentrate on those
|
||||
observations that are missed in the previous iterations.
|
||||
</section>
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec45">AdaBoost Examples </h2>
|
||||
<h2 id="___sec46">Figure to Illustrate the Iterative Classification Process </h2>
|
||||
</section>
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec47">AdaBoost Examples </h2>
|
||||
|
||||
<p>
|
||||
Using <b>Scikit-Learn</b> it is easy to appply the adaptive boosting algorithm, as done here.
|
||||
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -1902,12 +1939,12 @@ plt.show()
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec46">Gradient boosting: Basic Algorithm </h2>
|
||||
<h2 id="___sec48">Gradient boosting: Basic Algorithm </h2>
|
||||
</section>
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec47">Gradient Boosting, Examples </h2>
|
||||
<h2 id="___sec49">Gradient Boosting, Examples </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -1998,7 +2035,7 @@ plt.show()
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec48">Gradient Boots with Early Stopping </h2>
|
||||
<h2 id="___sec50">Gradient Boots with Early Stopping </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -2063,7 +2100,7 @@ error_going_up = <span style="color: #B452CD">0</span>
|
||||
|
||||
|
||||
<section>
|
||||
<h2 id="___sec49">XGBoost: Extreme Gradient Boosting </h2>
|
||||
<h2 id="___sec51">XGBoost: Extreme Gradient Boosting </h2>
|
||||
</section>
|
||||
|
||||
|
||||
|
||||
@@ -120,20 +120,25 @@ div { text-align: justify; text-justify: inter-word; }
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -1732,7 +1737,13 @@ this setting.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec39">A simple scikit-learn example </h2>
|
||||
<h2 id="___sec39">Random Forest Algorithm </h2>
|
||||
The algorithm described here can be applied to both classification and regression problems.
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec40">A simple scikit-learn example </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -1750,7 +1761,7 @@ accuracy = cross_validate(Random_Forest_model,X,Y,cv=<span style="color: #B452CD
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec40">Then random forests </h2>
|
||||
<h2 id="___sec41">Then random forests </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -1772,7 +1783,7 @@ np.sum(y_pred == y_pred_rf) / <span style="color: #658b00">len</span>(y_pred)
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec41">Feature Importance </h2>
|
||||
<h2 id="___sec42">Feature Importance </h2>
|
||||
|
||||
<p>
|
||||
Example will be added here.
|
||||
@@ -1780,7 +1791,7 @@ Example will be added here.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec42">Boosting, a Bird'e Eye </h2>
|
||||
<h2 id="___sec43">Boosting, a Bird'e Eye </h2>
|
||||
|
||||
<p>
|
||||
The basic idea is to combine weak classifiers in order to create a good
|
||||
@@ -1797,7 +1808,7 @@ them with a factor.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec43">Adaptive boosting: AdaBoost, Basic Algorithm </h2>
|
||||
<h2 id="___sec44">Adaptive boosting: AdaBoost, Basic Algorithm </h2>
|
||||
|
||||
<p>
|
||||
The algorithm here is rather straightforward. Assume that our weak
|
||||
@@ -1819,7 +1830,7 @@ where the function \( I() \) is one if we misclassify and zero if we classify co
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec44">Basic Steps of AdaBoost </h2>
|
||||
<h2 id="___sec45">Basic Steps of AdaBoost </h2>
|
||||
|
||||
<p>
|
||||
With the above definitions we are now ready to set up the algorithm for AdaBoost.
|
||||
@@ -1834,10 +1845,41 @@ $$
|
||||
\mathrm{err}=\frac{\sum_{i=0}^{n-1}w_iI(y_i\ne G(\boldsymbol{X}_{i*})}{\sum_{i=0}^{n-1}w_i},
|
||||
$$
|
||||
|
||||
|
||||
<ol>
|
||||
<li> Then we start looping over all attempts at classifying, namely we start an iterative process for \( m=1:M \), where \( M \) is the final number of classifications. Our given classifier could for example be a plain decision tree.
|
||||
|
||||
<ol type="a"></li>
|
||||
<li> Fit thus a given classifier to the training using the weights \( w_i \).</li>
|
||||
<li> Compute then \( \mathrm{err} \) and figure out which events are classified properly and which are classified wrongly.</li>
|
||||
<li> Define a quantity $\alpha_{m} = \log{(1-\mathrm{err})/\mathrm{err}}</li>
|
||||
<li> Set the new weights to $w_i = w_i\times \exp{(\alpha_m I(y_i\ne G(\boldsymbol{X}_{i*})}.</li>
|
||||
</ol>
|
||||
|
||||
<li> Compute the new classifier $G(\boldsymbol{X})= \sum_{i=0}^{n-1}\alpha_m I(y_i\ne G(\boldsymbol{X}_{i*}).</li>
|
||||
</ol>
|
||||
|
||||
For the iterations with \( m \le 2 \) the weights are modified
|
||||
individually at each steps. The obersvations which were misclassified
|
||||
at iteration \( m-1 \) have a weight which is larger than those which were
|
||||
classified properly. As this proceeds, the observations which were
|
||||
difficult to classifiy correctly are given a larger influence. Each
|
||||
new classificatio step \( m \) is then forced to concentrate on those
|
||||
observations that are missed in the previous iterations.
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec45">AdaBoost Examples </h2>
|
||||
<h2 id="___sec46">Figure to Illustrate the Iterative Classification Process </h2>
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec47">AdaBoost Examples </h2>
|
||||
|
||||
<p>
|
||||
Using <b>Scikit-Learn</b> it is easy to appply the adaptive boosting algorithm, as done here.
|
||||
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -1876,12 +1918,12 @@ plt.show()
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec46">Gradient boosting: Basic Algorithm </h2>
|
||||
<h2 id="___sec48">Gradient boosting: Basic Algorithm </h2>
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec47">Gradient Boosting, Examples </h2>
|
||||
<h2 id="___sec49">Gradient Boosting, Examples </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -1971,7 +2013,7 @@ plt.show()
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec48">Gradient Boots with Early Stopping </h2>
|
||||
<h2 id="___sec50">Gradient Boots with Early Stopping </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "perldoc" -->
|
||||
@@ -2035,7 +2077,7 @@ error_going_up = <span style="color: #B452CD">0</span>
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec49">XGBoost: Extreme Gradient Boosting </h2>
|
||||
<h2 id="___sec51">XGBoost: Extreme Gradient Boosting </h2>
|
||||
|
||||
<p>
|
||||
|
||||
|
||||
@@ -125,20 +125,25 @@ div { text-align: justify; text-justify: inter-word; }
|
||||
'___sec36'),
|
||||
('Now Bagging', 2, None, '___sec37'),
|
||||
('Random forests', 2, None, '___sec38'),
|
||||
('A simple scikit-learn example', 2, None, '___sec39'),
|
||||
('Then random forests', 2, None, '___sec40'),
|
||||
('Feature Importance', 2, None, '___sec41'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec42'),
|
||||
('Random Forest Algorithm', 2, None, '___sec39'),
|
||||
('A simple scikit-learn example', 2, None, '___sec40'),
|
||||
('Then random forests', 2, None, '___sec41'),
|
||||
('Feature Importance', 2, None, '___sec42'),
|
||||
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
|
||||
('Adaptive boosting: AdaBoost, Basic Algorithm',
|
||||
2,
|
||||
None,
|
||||
'___sec43'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec44'),
|
||||
('AdaBoost Examples', 2, None, '___sec45'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec46'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec47'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec48'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec49')]}
|
||||
'___sec44'),
|
||||
('Basic Steps of AdaBoost', 2, None, '___sec45'),
|
||||
('Figure to Illustrate the Iterative Classification Process',
|
||||
2,
|
||||
None,
|
||||
'___sec46'),
|
||||
('AdaBoost Examples', 2, None, '___sec47'),
|
||||
('Gradient boosting: Basic Algorithm', 2, None, '___sec48'),
|
||||
('Gradient Boosting, Examples', 2, None, '___sec49'),
|
||||
('Gradient Boots with Early Stopping', 2, None, '___sec50'),
|
||||
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec51')]}
|
||||
end of tocinfo -->
|
||||
|
||||
<body>
|
||||
@@ -1737,7 +1742,13 @@ this setting.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec39">A simple scikit-learn example </h2>
|
||||
<h2 id="___sec39">Random Forest Algorithm </h2>
|
||||
The algorithm described here can be applied to both classification and regression problems.
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec40">A simple scikit-learn example </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "default" -->
|
||||
@@ -1755,7 +1766,7 @@ accuracy <span style="color: #666666">=</span> cross_validate(Random_Forest_mode
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec40">Then random forests </h2>
|
||||
<h2 id="___sec41">Then random forests </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "default" -->
|
||||
@@ -1777,7 +1788,7 @@ np<span style="color: #666666">.</span>sum(y_pred <span style="color: #666666">=
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec41">Feature Importance </h2>
|
||||
<h2 id="___sec42">Feature Importance </h2>
|
||||
|
||||
<p>
|
||||
Example will be added here.
|
||||
@@ -1785,7 +1796,7 @@ Example will be added here.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec42">Boosting, a Bird'e Eye </h2>
|
||||
<h2 id="___sec43">Boosting, a Bird'e Eye </h2>
|
||||
|
||||
<p>
|
||||
The basic idea is to combine weak classifiers in order to create a good
|
||||
@@ -1802,7 +1813,7 @@ them with a factor.
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec43">Adaptive boosting: AdaBoost, Basic Algorithm </h2>
|
||||
<h2 id="___sec44">Adaptive boosting: AdaBoost, Basic Algorithm </h2>
|
||||
|
||||
<p>
|
||||
The algorithm here is rather straightforward. Assume that our weak
|
||||
@@ -1824,7 +1835,7 @@ where the function \( I() \) is one if we misclassify and zero if we classify co
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec44">Basic Steps of AdaBoost </h2>
|
||||
<h2 id="___sec45">Basic Steps of AdaBoost </h2>
|
||||
|
||||
<p>
|
||||
With the above definitions we are now ready to set up the algorithm for AdaBoost.
|
||||
@@ -1839,10 +1850,41 @@ $$
|
||||
\mathrm{err}=\frac{\sum_{i=0}^{n-1}w_iI(y_i\ne G(\boldsymbol{X}_{i*})}{\sum_{i=0}^{n-1}w_i},
|
||||
$$
|
||||
|
||||
|
||||
<ol>
|
||||
<li> Then we start looping over all attempts at classifying, namely we start an iterative process for \( m=1:M \), where \( M \) is the final number of classifications. Our given classifier could for example be a plain decision tree.
|
||||
|
||||
<ol type="a"></li>
|
||||
<li> Fit thus a given classifier to the training using the weights \( w_i \).</li>
|
||||
<li> Compute then \( \mathrm{err} \) and figure out which events are classified properly and which are classified wrongly.</li>
|
||||
<li> Define a quantity $\alpha_{m} = \log{(1-\mathrm{err})/\mathrm{err}}</li>
|
||||
<li> Set the new weights to $w_i = w_i\times \exp{(\alpha_m I(y_i\ne G(\boldsymbol{X}_{i*})}.</li>
|
||||
</ol>
|
||||
|
||||
<li> Compute the new classifier $G(\boldsymbol{X})= \sum_{i=0}^{n-1}\alpha_m I(y_i\ne G(\boldsymbol{X}_{i*}).</li>
|
||||
</ol>
|
||||
|
||||
For the iterations with \( m \le 2 \) the weights are modified
|
||||
individually at each steps. The obersvations which were misclassified
|
||||
at iteration \( m-1 \) have a weight which is larger than those which were
|
||||
classified properly. As this proceeds, the observations which were
|
||||
difficult to classifiy correctly are given a larger influence. Each
|
||||
new classificatio step \( m \) is then forced to concentrate on those
|
||||
observations that are missed in the previous iterations.
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec45">AdaBoost Examples </h2>
|
||||
<h2 id="___sec46">Figure to Illustrate the Iterative Classification Process </h2>
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec47">AdaBoost Examples </h2>
|
||||
|
||||
<p>
|
||||
Using <b>Scikit-Learn</b> it is easy to appply the adaptive boosting algorithm, as done here.
|
||||
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "default" -->
|
||||
@@ -1881,12 +1923,12 @@ plt<span style="color: #666666">.</span>show()
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec46">Gradient boosting: Basic Algorithm </h2>
|
||||
<h2 id="___sec48">Gradient boosting: Basic Algorithm </h2>
|
||||
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec47">Gradient Boosting, Examples </h2>
|
||||
<h2 id="___sec49">Gradient Boosting, Examples </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "default" -->
|
||||
@@ -1976,7 +2018,7 @@ plt<span style="color: #666666">.</span>show()
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec48">Gradient Boots with Early Stopping </h2>
|
||||
<h2 id="___sec50">Gradient Boots with Early Stopping </h2>
|
||||
<p>
|
||||
|
||||
<!-- code=python (!bc pycod) typeset with pygments style "default" -->
|
||||
@@ -2040,7 +2082,7 @@ error_going_up <span style="color: #666666">=</span> <span style="color: #666666
|
||||
<p>
|
||||
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
|
||||
|
||||
<h2 id="___sec49">XGBoost: Extreme Gradient Boosting </h2>
|
||||
<h2 id="___sec51">XGBoost: Extreme Gradient Boosting </h2>
|
||||
|
||||
<p>
|
||||
|
||||
|
||||
@@ -1762,6 +1762,10 @@
|
||||
"not lead to a substantial reduction in variance over a single tree in\n",
|
||||
"this setting.\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"## Random Forest Algorithm\n",
|
||||
"The algorithm described here can be applied to both classification and regression problems.\n",
|
||||
"\n",
|
||||
"## A simple scikit-learn example"
|
||||
]
|
||||
},
|
||||
@@ -1894,7 +1898,33 @@
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## AdaBoost Examples"
|
||||
"1. Then we start looping over all attempts at classifying, namely we start an iterative process for $m=1:M$, where $M$ is the final number of classifications. Our given classifier could for example be a plain decision tree.\n",
|
||||
"\n",
|
||||
"a. Fit thus a given classifier to the training using the weights $w_i$.\n",
|
||||
"\n",
|
||||
"b. Compute then $\\mathrm{err}$ and figure out which events are classified properly and which are classified wrongly.\n",
|
||||
"\n",
|
||||
"c. Define a quantity $\\alpha_{m} = \\log{(1-\\mathrm{err})/\\mathrm{err}}\n",
|
||||
"\n",
|
||||
"d. Set the new weights to $w_i = w_i\\times \\exp{(\\alpha_m I(y_i\\ne G(\\boldsymbol{X}_{i*})}.\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"5. Compute the new classifier $G(\\boldsymbol{X})= \\sum_{i=0}^{n-1}\\alpha_m I(y_i\\ne G(\\boldsymbol{X}_{i*}).\n",
|
||||
"\n",
|
||||
"For the iterations with $m \\le 2$ the weights are modified\n",
|
||||
"individually at each steps. The obersvations which were misclassified\n",
|
||||
"at iteration $m-1$ have a weight which is larger than those which were\n",
|
||||
"classified properly. As this proceeds, the observations which were\n",
|
||||
"difficult to classifiy correctly are given a larger influence. Each\n",
|
||||
"new classificatio step $m$ is then forced to concentrate on those\n",
|
||||
"observations that are missed in the previous iterations.\n",
|
||||
"\n",
|
||||
"## Figure to Illustrate the Iterative Classification Process\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"## AdaBoost Examples\n",
|
||||
"\n",
|
||||
"Using **Scikit-Learn** it is easy to appply the adaptive boosting algorithm, as done here."
|
||||
]
|
||||
},
|
||||
{
|
||||
|
||||
Binary file not shown.
Binary file not shown.
@@ -1420,6 +1420,11 @@ uncorrelated quanti- ties. In particular, this means that bagging will
|
||||
not lead to a substantial reduction in variance over a single tree in
|
||||
this setting.
|
||||
|
||||
|
||||
!split
|
||||
===== Random Forest Algorithm =====
|
||||
The algorithm described here can be applied to both classification and regression problems.
|
||||
|
||||
!split
|
||||
===== A simple scikit-learn example =====
|
||||
!bc pycod
|
||||
@@ -1509,11 +1514,30 @@ o We rewrite the misclassification error as
|
||||
\mathrm{err}=\frac{\sum_{i=0}^{n-1}w_iI(y_i\ne G(\bm{X}_{i*})}{\sum_{i=0}^{n-1}w_i},
|
||||
\]
|
||||
!et
|
||||
o Then we start looping over all attempts at classifying, namely we start an iterative process for $m=1:M$, where $M$ is the final number of classifications. Our given classifier could for example be a plain decision tree.
|
||||
o Fit thus a given classifier to the training using the weights $w_i$.
|
||||
o Compute then $\mathrm{err}$ and figure out which events are classified properly and which are classified wrongly.
|
||||
o Define a quantity $\alpha_{m} = \log{(1-\mathrm{err})/\mathrm{err}}
|
||||
o Set the new weights to $w_i = w_i\times \exp{(\alpha_m I(y_i\ne G(\bm{X}_{i*})}.
|
||||
o Compute the new classifier $G(\bm{X})= \sum_{i=0}^{n-1}\alpha_m I(y_i\ne G(\bm{X}_{i*}).
|
||||
|
||||
For the iterations with $m \le 2$ the weights are modified
|
||||
individually at each steps. The obersvations which were misclassified
|
||||
at iteration $m-1$ have a weight which is larger than those which were
|
||||
classified properly. As this proceeds, the observations which were
|
||||
difficult to classifiy correctly are given a larger influence. Each
|
||||
new classificatio step $m$ is then forced to concentrate on those
|
||||
observations that are missed in the previous iterations.
|
||||
|
||||
!split
|
||||
===== Figure to Illustrate the Iterative Classification Process =====
|
||||
|
||||
|
||||
!split
|
||||
===== AdaBoost Examples =====
|
||||
|
||||
Using _Scikit-Learn_ it is easy to appply the adaptive boosting algorithm, as done here.
|
||||
|
||||
!bc pycod
|
||||
from sklearn.ensemble import AdaBoostClassifier
|
||||
|
||||
|
||||
Reference in New Issue
Block a user