Gradient Boosting
Gradient Boosting is a machine learning ensemble method that iteratively combines weak predictive models, typically decision trees, by sequentially minimizing a loss function through gradient descent, with each subsequent model correcting the residual errors of its predecessor.
4K
Publications
286.1K
Citations
17.1K
Authors
4.4K
Institutions
Publications per year
2017–2026
3.6K
4K
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
LightGBM: A Highly Efficient Gradient Boosting Decision Tree
Guolin Ke, Qi Meng, Thomas Finley et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2017 · 9.5K citations · Full text
XGBoost: A Scalable Tree Boosting System
arXiv (Cornell University) · 2016 · 7.1K citations · Full text
1–5 of 4K
17.1K
11
h-index
11
h-index
11
h-index
Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
10 publications · 1.2K citations
10
h-index
10
h-index
1–5 of 17.1K
4.4K

Chinese Academy of Sciences
Beijing, China
33 h-index
228 publications
20K citations

Central South University
Changsha, China
28 h-index
161 publications
10.7K citations
University of Chinese Academy of Sciences
Beijing, China
27 h-index
118 publications
5.9K citations

Peking University
Beijing, China
26 h-index
100 publications
4.5K citations
Wuhan University
Wuhan, China
26 h-index
101 publications
4.3K citations
Tsinghua University
Beijing, China
25 h-index
72 publications
4.8K citations

Zhejiang University
Hangzhou, China
24 h-index
117 publications
9.8K citations

Shanghai Jiao Tong University
Shanghai, China
24 h-index
105 publications
4.2K citations
1–8 of 4.4K
120 publications · 10K citations
52
h-index
128 publications · 7.1K citations
45
h-index
74 publications · 3.5K citations
35
h-index
55 publications · 2.2K citations
29
h-index
55 publications · 2.5K citations
29
h-index
1–5