Skip to content

Commit 5dca674

Browse files
edoffagneterrytangyuan
authored andcommitted
Fixed typo in doc (dmlc#2799)
1 parent b1793da commit 5dca674

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

doc/R-package/xgboostPresentation.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -71,7 +71,7 @@ require(xgboost)
7171
### Dataset presentation
7272

7373

74-
In this example, we are aiming to predict whether a mushroom can be eaten or not (like in many tutorials, example data are the the same as you will use on in your every day life :-).
74+
In this example, we are aiming to predict whether a mushroom can be eaten or not (like in many tutorials, example data are the same as you will use on in your every day life :-).
7575

7676
Mushroom data is cited from UCI Machine Learning Repository. @Bache+Lichman:2013.
7777

@@ -415,7 +415,7 @@ bst <- xgb.train(data=dtrain, booster = "gblinear", max.depth=2, nthread = 2, nr
415415
## [1] train-error:0.004146 train-logloss:0.069885 test-error:0.003724 test-logloss:0.068081
416416
```
417417

418-
In this specific case, *linear boosting* gets sligtly better performance metrics than decision trees based algorithm.
418+
In this specific case, *linear boosting* gets slightly better performance metrics than decision trees based algorithm.
419419

420420
In simple cases, it will happen because there is nothing better than a linear algorithm to catch a linear link. However, decision trees are much better to catch a non linear link between predictors and outcome. Because there is no silver bullet, we advise you to check both algorithms with your own datasets to have an idea of what to use.
421421

0 commit comments

Comments
 (0)