Cited by 54,569Statistical Methods and InferenceMachine Learning and Data ClassificationData Mining Algorithms and Applications

The DOI matches its Crossref record; 20 of the 21 references it cites were found in a registry or an index.

XGBoost: A Scalable Tree Boosting System

Open access
Chen, Tianqi, Guestrin, Carlos·2016·Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Abstract

Tree boosting is a highly effective and widely used machine learning method. In this paper, we describe a scalable end-to-end tree boosting system called XGBoost, which is used widely by data scientists to achieve state-of-the-art results on many machine learning challenges. We propose a novel sparsity-aware algorithm for sparse data and weighted quantile sketch for approximate tree learning. More importantly, we provide insights on cache access patterns, data compression and sharding to build a scalable tree boosting system. By combining these insights, XGBoost scales beyond billions of examples using far fewer resources than existing systems.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2939672.2939785

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 21 references

Research works printed but not linked: 7

  1. 10.5555/2124408 · DOI
  2. J. Bennett and S. Lanning. The netflix prize. In Proceedings of the KDD Cup Workshop 2007, pages 3--6, New York, Aug. 2007.
  3. T. Chen, H. Li, Q. Yang, and Y. Yu. General functional matrix factorization using gradient boosting. In Proceeding of 30th International Conference on Machine Learning (ICML'13), volume 1, pages 436--444, 2013.
  4. T. Chen, S. Singh, B. Taskar, and C. Guestrin. Efficient second-order gradient boosting for conditional random fields. In Proceeding of 18th Artificial Intelligence and Statistics Conference (AISTATS'15), volume 1, 2015.
  5. 10.5555/3023549.3023585 · DOI
  6. 10.5555/2981562.2981675 · DOI
  7. 10.5555/2946645.2946679 · DOI

Cited by

Sorted by citations

Items 1,001–1,100 of 1,239

Metadata

Authors
Chen, T., & Guestrin, C.
Affiliations
University of Washington (US)
Venue
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Publisher
ACM
Published
2016-08-13
Pages
785-794
OpenAlex
W2295598076
Cited by
54,569
References
21
Citations by year
2026: 12394 · 2025: 11769 · 2024: 8715 · 2023: 6731 · 2022: 5369 · 2021: 4238 · 2020: 2665 · 2019: 1560 · 2018: 779 · 2017: 294 · 2016: 48
FWCI
936.68
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
Funders
  • Office of Naval Research (N000141010672)
  • National Science Foundation (1258741)
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
Keywords
XGBoost, gradient boosting decision tree, gradient boosting, data sparsity, data compression, data sharding, scalability, large-scale machine learning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review