The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Stochastic gradient boosted distributed decision trees
Abstract
Stochastic Gradient Boosted Decision Trees (GBDT) is one of the most widely used learning algorithms in machine learning today. It is adaptable, easy to interpret, and produces highly accurate models. However, most implementations today are computationally expensive and require all training data to be in main memory. As training data becomes ever larger, there is motivation for us to parallelize the GBDT algorithm. Parallelizing decision tree training is intuitive and various approaches have been explored in existing literature. Stochastic boosting on the other hand is inherently a sequential process and have not been applied to distributed decision trees. In this work, we present two different distributed methods that generates exact stochastic GBDT models, the first is a MapReduce implementation and the second utilizes MPI on the Hadoop grid environment.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Friedman, J. H. (2002) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(01)00065-2 · Cited by 7,067
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Gehrke, J., Ramakrishnan, R., & Ganti, V. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009839829793 · Cited by 348
A Survey of Methods for Scaling Up Inductive Algorithms
Provost, F., & Kolluri, V. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009876119989 · Cited by 277
A regression framework for learning ranking functions using relative relevance judgments
Zheng, Z., Chen, K., Sun, G., & Zha, H. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277792 · Cited by 204
Self-citationCaragea, D., Silvescu, A., & Honavar, V. (2004) · International Journal of Hybrid Intelligent Systems · doi:10.3233/his-2004-11-210 · Cited by 85
Trada: tree based ranking function adaptation
Chen, K., Rong-qing, L., Wong, C. K., Sun, G., Heck, L. P., & Tseng, B. L. (2008) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1458082.1458233 · Cited by 41
Cited by
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939785 · Cited by 54,569
Decision forest: Twenty years of research
Rokach, L. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.06.005 · Cited by 472
Learning to Rank Using User Clicks and Visual Features for Image Retrieval
Yu, J., Tao, D., Wang, M., & Rui, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2336697 · Cited by 445
An up-to-date comparison of state-of-the-art classification algorithms
Zhang, C., Liu, C., Zhang, X., & Almpanidis, G. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.04.003 · Cited by 440
GraphLab: A New Framework For Parallel Machine Learning
Low, Y., Gonzalez, J. E., Kyrola, A., Bickson, D., Guestrin, C., & Hellerstein, J. M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.2041 · Cited by 425
Metadata
- Authors
- Ye, J., Chow, J.-H., Chen, J., & Zheng, Z.
- Venue
- Proceedings of the 18th ACM conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2009-11-02
- Pages
- 2061-2064
- OpenAlex
- W2008183828
- Cited by
- 324
- References
- 12
- FWCI
- 5.48
- Type
- conference paper
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.