Skip to content

Commit e014352

Browse files
mhjensenmhjensen
committed
added xgboost example
1 parent 8562446 commit e014352

64 files changed

Lines changed: 3361 additions & 4153 deletions

File tree

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

‎doc/pub/DecisionTrees/html/._DecisionTrees-bs000.html‎

Lines changed: 46 additions & 44 deletions
Original file line numberDiff line numberDiff line change
@@ -89,42 +89,43 @@
8989
2,
9090
None,
9191
'___sec31'),
92-
('Bagging', 2, None, '___sec32'),
93-
('More bagging', 2, None, '___sec33'),
94-
('Simple Voting Example, head or tail', 2, None, '___sec34'),
95-
('Using the Voting Classifier', 2, None, '___sec35'),
92+
('An Overview of Ensemble Methods', 2, None, '___sec32'),
93+
('Bagging', 2, None, '___sec33'),
94+
('More bagging', 2, None, '___sec34'),
95+
('Simple Voting Example, head or tail', 2, None, '___sec35'),
96+
('Using the Voting Classifier', 2, None, '___sec36'),
9697
('Please, not the moons again! Voting and Bagging',
9798
2,
9899
None,
99-
'___sec36'),
100-
('Now Bagging', 2, None, '___sec37'),
101-
('Random forests', 2, None, '___sec38'),
102-
('Random Forest Algorithm', 2, None, '___sec39'),
100+
'___sec37'),
101+
('Now Bagging', 2, None, '___sec38'),
102+
('Random forests', 2, None, '___sec39'),
103+
('Random Forest Algorithm', 2, None, '___sec40'),
103104
('Random Forests Compared with other Methods on the Cancer Data',
104105
2,
105106
None,
106-
'___sec40'),
107+
'___sec41'),
107108
('Compare Bagging on Trees with Random Forests',
108109
2,
109110
None,
110-
'___sec41'),
111-
('Feature Importance', 2, None, '___sec42'),
112-
("Boosting, a Bird'e Eye", 2, None, '___sec43'),
111+
'___sec42'),
112+
('Feature Importance', 2, None, '___sec43'),
113+
("Boosting, a Bird'e Eye", 2, None, '___sec44'),
113114
('Adaptive boosting: AdaBoost, Basic Algorithm',
114115
2,
115116
None,
116-
'___sec44'),
117-
('Basic Steps of AdaBoost', 2, None, '___sec45'),
117+
'___sec45'),
118+
('Basic Steps of AdaBoost', 2, None, '___sec46'),
118119
('Figure to Illustrate the Iterative Classification Process',
119120
2,
120121
None,
121-
'___sec46'),
122-
('AdaBoost Examples', 2, None, '___sec47'),
123-
('Gradient boosting: Basics', 2, None, '___sec48'),
124-
('Gradient Boosting, algorithm', 2, None, '___sec49'),
125-
('Gradient Boosting, Examples', 2, None, '___sec50'),
126-
('Gradient Boots with Early Stopping', 2, None, '___sec51'),
127-
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec52')]}
122+
'___sec47'),
123+
('AdaBoost Examples', 2, None, '___sec48'),
124+
('Gradient boosting: Basics', 2, None, '___sec49'),
125+
('Gradient Boosting, algorithm', 2, None, '___sec50'),
126+
('Gradient Boosting, Examples', 2, None, '___sec51'),
127+
('Gradient Boots with Early Stopping', 2, None, '___sec52'),
128+
('XGBoost: Extreme Gradient Boosting', 2, None, '___sec53')]}
128129
end of tocinfo -->
129130

130131
<body>
@@ -194,27 +195,28 @@
194195
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs030.html#___sec29" style="font-size: 80%;">Pros and cons of trees, pros</a></li>
195196
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs031.html#___sec30" style="font-size: 80%;">Disadvantages</a></li>
196197
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs032.html#___sec31" style="font-size: 80%;">From a Single Tree to Many Trees, Meet the Jungle of Methods</a></li>
197-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs033.html#___sec32" style="font-size: 80%;">Bagging</a></li>
198-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs034.html#___sec33" style="font-size: 80%;">More bagging</a></li>
199-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs035.html#___sec34" style="font-size: 80%;">Simple Voting Example, head or tail</a></li>
200-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs036.html#___sec35" style="font-size: 80%;">Using the Voting Classifier</a></li>
201-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
202-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Now Bagging</a></li>
203-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Random forests</a></li>
204-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random Forest Algorithm</a></li>
205-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Random Forests Compared with other Methods on the Cancer Data</a></li>
206-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Compare Bagging on Trees with Random Forests</a></li>
207-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Feature Importance</a></li>
208-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
209-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
210-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
211-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
212-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">AdaBoost Examples</a></li>
213-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">Gradient boosting: Basics</a></li>
214-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient Boosting, algorithm</a></li>
215-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
216-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
217-
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs053.html#___sec52" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
198+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs033.html#___sec32" style="font-size: 80%;">An Overview of Ensemble Methods</a></li>
199+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs034.html#___sec33" style="font-size: 80%;">Bagging</a></li>
200+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs035.html#___sec34" style="font-size: 80%;">More bagging</a></li>
201+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs036.html#___sec35" style="font-size: 80%;">Simple Voting Example, head or tail</a></li>
202+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs037.html#___sec36" style="font-size: 80%;">Using the Voting Classifier</a></li>
203+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs038.html#___sec37" style="font-size: 80%;">Please, not the moons again! Voting and Bagging</a></li>
204+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs039.html#___sec38" style="font-size: 80%;">Now Bagging</a></li>
205+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs040.html#___sec39" style="font-size: 80%;">Random forests</a></li>
206+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs041.html#___sec40" style="font-size: 80%;">Random Forest Algorithm</a></li>
207+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs042.html#___sec41" style="font-size: 80%;">Random Forests Compared with other Methods on the Cancer Data</a></li>
208+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs043.html#___sec42" style="font-size: 80%;">Compare Bagging on Trees with Random Forests</a></li>
209+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs044.html#___sec43" style="font-size: 80%;">Feature Importance</a></li>
210+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs045.html#___sec44" style="font-size: 80%;">Boosting, a Bird'e Eye</a></li>
211+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs046.html#___sec45" style="font-size: 80%;">Adaptive boosting: AdaBoost, Basic Algorithm</a></li>
212+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs047.html#___sec46" style="font-size: 80%;">Basic Steps of AdaBoost</a></li>
213+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs048.html#___sec47" style="font-size: 80%;">Figure to Illustrate the Iterative Classification Process</a></li>
214+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs049.html#___sec48" style="font-size: 80%;">AdaBoost Examples</a></li>
215+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs050.html#___sec49" style="font-size: 80%;">Gradient boosting: Basics</a></li>
216+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs051.html#___sec50" style="font-size: 80%;">Gradient Boosting, algorithm</a></li>
217+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs052.html#___sec51" style="font-size: 80%;">Gradient Boosting, Examples</a></li>
218+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs053.html#___sec52" style="font-size: 80%;">Gradient Boots with Early Stopping</a></li>
219+
<!-- navigation toc: --> <li><a href="._DecisionTrees-bs054.html#___sec53" style="font-size: 80%;">XGBoost: Extreme Gradient Boosting</a></li>
218220

219221
</ul>
220222
</li>
@@ -249,7 +251,7 @@
249251
<center>[2] <b>Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University</b></center>
250252
<br>
251253
<p>
252-
<center><h4>Nov 5, 2019</h4></center> <!-- date -->
254+
<center><h4>Nov 6, 2019</h4></center> <!-- date -->
253255
<br>
254256
<p>
255257

@@ -273,7 +275,7 @@
273275
<li><a href="._DecisionTrees-bs008.html">9</a></li>
274276
<li><a href="._DecisionTrees-bs009.html">10</a></li>
275277
<li><a href="">...</a></li>
276-
<li><a href="._DecisionTrees-bs053.html">54</a></li>
278+
<li><a href="._DecisionTrees-bs054.html">55</a></li>
277279
<li><a href="._DecisionTrees-bs001.html">&raquo;</a></li>
278280
</ul>
279281
<!-- ------------------- end of main content --------------- -->

0 commit comments

Comments
 (0)