Extreme Gradient Boosting
Extreme Gradient Boosting is a machine learning algorithm in the ensemble learning family that iteratively combines weak predictive models, primarily decision trees, by sequentially minimizing a loss function through gradient descent while enhancing computational efficiency and regularization to improve predictive accuracy and prevent overfitting.
3.6K
Publications
163K
Citations
14.5K
Authors
3.7K
Institutions
Publications per year
2017–2026
3.5K
Parents
3.6K
A Short Introduction to Boosting
Yoav Freund, Robert E. Schapire · 1999 · 3K citations
A brief introduction to boosting
Robert E. Schapire · 1999 · 1.2K citations
1–5 of 3.6K
14.5K
14
h-index
Jiangxi University of Water Resources and Electric Power, China
10 publications · 1.3K citations
10
h-index
10
h-index
9
h-index
9
h-index
1–5 of 14.5K
3.7K

Chinese Academy of Sciences
Beijing, China
38 h-index
273 publications
13.8K citations

Central South University
Changsha, China
33 h-index
242 publications
14.1K citations

Zhejiang University
Hangzhou, China
32 h-index
167 publications
13.8K citations
Wuhan University
Wuhan, China
28 h-index
125 publications
6K citations
University of Chinese Academy of Sciences
Beijing, China
28 h-index
113 publications
7.8K citations

Chongqing University
Chongqing, China
25 h-index
116 publications
14.7K citations

Sun Yat-sen University
Guangzhou, China
23 h-index
180 publications
10.3K citations
Tongji University
Shanghai, China
23 h-index
95 publications
4.1K citations
1–8 of 3.7K
97 publications · 7.7K citations
47
h-index
112 publications · 5.9K citations
46
h-index
128 publications · 6.1K citations
45
h-index
57 publications · 2.6K citations
31
h-index
44 publications · 1.7K citations
27
h-index
1–5