pub enum TreeMethod {
Auto,
Exact,
Approx,
Hist,
GpuExact,
GpuHist,
}
Expand description
The tree construction algorithm used in XGBoost (see description in the reference paper).
Distributed and external memory version only support approximate algorithm.
Variants§
Auto
Use heuristic to choose faster one.
- For small to medium dataset, exact greedy will be used.
- For very large-dataset, approximate algorithm will be chosen.
- Because old behavior is always use exact greedy in single machine, user will get a message when approximate algorithm is chosen to notify this choice.
Exact
Exact greedy algorithm.
Approx
Approximate greedy algorithm using sketching and histogram.
Hist
Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching.
GpuExact
GPU implementation of exact algorithm.
GpuHist
GPU implementation of hist algorithm.
Trait Implementations§
Source§impl Clone for TreeMethod
impl Clone for TreeMethod
Source§fn clone(&self) -> TreeMethod
fn clone(&self) -> TreeMethod
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Default for TreeMethod
impl Default for TreeMethod
Auto Trait Implementations§
impl Freeze for TreeMethod
impl RefUnwindSafe for TreeMethod
impl Send for TreeMethod
impl Sync for TreeMethod
impl Unpin for TreeMethod
impl UnwindSafe for TreeMethod
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more