From 8ad7e8eeb050c835520454043d0f7a8ba6469892 Mon Sep 17 00:00:00 2001 From: Jiaming Yuan Date: Fri, 17 Sep 2021 11:13:49 +0800 Subject: [PATCH] [doc] Fix typo. [skip ci] (#7226) --- doc/treemethod.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/treemethod.rst b/doc/treemethod.rst index 38d9822b6..50964fc9e 100644 --- a/doc/treemethod.rst +++ b/doc/treemethod.rst @@ -19,9 +19,9 @@ Exact Solution Exact means XGBoost considers all candidates from data for tree splitting, but underlying the objective is still interpreted as a Taylor expansion. -1. ``exact``: Vanilla tree boosting tree algorithm described in `reference paper +1. ``exact``: Vanilla gradient boosting tree algorithm described in `reference paper `_. During each split finding procedure, it iterates - over every entry of input data. It's more accurate (among other greedy methods) but + over all entries of input data. It's more accurate (among other greedy methods) but slow in computation performance. Also it doesn't support distributed training as XGBoost employs row spliting data distribution while ``exact`` tree method works on a sorted column format. This tree method can be used with parameter ``tree_method`` set