The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
PLANET: massively parallel learning of tree ensembles with MapReduce
Abstract
Classification and regression tree learning on massive datasets is a common data mining task at Google, yet many state of the art tree learning algorithms require training data to reside in memory on a single machine. While more scalable implementations of tree learning have been proposed, they typically require specialized parallel computing architectures. In contrast, the majority of Google's computing infrastructure is based on commodity hardware. In this paper, we describe PLANET: a scalable distributed framework for learning tree models over large datasets. PLANET defines tree learning as a series of distributed computations, and implements each one using the MapReduce model of distributed computation. We show how this framework supports scalable construction of classification and regression trees, as well as ensembles of such models. We discuss the benefits and challenges of using a MapReduce compute cluster for tree learning, and demonstrate the scalability of this approach by applying it to a real world learning task from the domain of computational advertising.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
An empirical comparison of supervised learning algorithms
Caruana, R., & Niculescu-Mizil, A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143865 · Cited by 2,780
International Conference on Machine Learning (ICML)-2005
津田, 宏. (2006) · 人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence · Cited by 2,558
Advances in Neural Information Processing Systems 19 (NIPS 2006)
Simonotto, E., Whalley, H. C., Lawrie, S. M., Murray, L. M., McGonigle, D. J., & Storkey, A. (2006) · Cited by 1,651
Map-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229
Generalized Boosted Models: A guide to the gbm package
Ridgeway, G. K. (2006) · Cited by 814
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
SLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
An empirical evaluation of supervised learning in high dimensions
Caruana, R., Karampatziakis, N., & Yessenalina, A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390169 · Cited by 524
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
Data Mining with Decision Trees: Theory and Applications
Rokach, L., & Maimon, O. (2007) · Series in Machine Perception and Artificial Intelligence · doi:10.1142/6604 · Cited by 324
BOAT—optimistic decision tree construction
Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W.-Y. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304197 · Cited by 288
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
The Association for Computing Machinery
Williams, S. B. (1954) · Journal of the ACM · doi:10.1145/320764.320765 · Cited by 266
A Streaming Parallel Decision Tree Algorithm
Ben‐Haim, Y., & Tom-Tov, E. (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1756034 · Cited by 165
Toward parallel and distributed learning by meta-learning
Chan, P. K., & Stolfo, S. J. (1993) · Cited by 151
BOAT—optimistic decision tree construction
Gehrke, J. E., Ganti, V., Ramakrishnan, R., & Loh, W. (1999) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/304182.304197 · Cited by 149
CLOUDS: a decision tree classifier for large datasets
Alsabti, K. A., Ranka, S., & Singh, V. K. (1998) · Cited by 148
ScalParC: a new scalable and efficient parallel classification algorithm for mining large datasets
Joshi, M. V., Karypis, G., & Kumar, V. (2002) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipps.1998.669983 · Cited by 147
Predicting bounce rates in sponsored search advertisements
Sculley, D., Malkin, R. G., Basu, S., & Bayardo, R. J. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557161 · Cited by 129
Self-citationCommunication and Memory Efficient Parallel Decision Tree Construction
Jin, R., & Agrawal, G. (2003) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.11 · Cited by 122
The distributed boosting algorithm
Lazarević, A. M., & Zoran Obradovic, A. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502557 · Cited by 88
Caragea, D., Silvescu, A., & Honavar, V. (2004) · International Journal of Hybrid Intelligent Systems · doi:10.3233/his-2004-11-210 · Cited by 85
Communication Efficient Construction of Decision Trees Over Heterogeneously Distributed Data
Giannella, C. R., Liu, K., Olsen, T., & Kargupta, H. (2005) · Proceedings · doi:10.1109/icdm.2004.10114 · Cited by 36
(1996)
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
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · arXiv · doi:10.48550/arxiv.1603.02754 · Cited by 7,104
Machine learning on big data: Opportunities and challenges
Zhou, L., Pan, S., Wang, J., & Vasilakos, A. V. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.01.026 · Cited by 1,228
MLlib: Machine Learning in Apache Spark
Meng, X., Bradley, J. K., Yavuz, B., Sparks, E., Venkataraman, S., Liu, D., Freeman, J., Tsai, D., Amde, M., Owen, S., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.06807 · Cited by 940
Intelligible models for classification and regression
Lou, Y., Caruana, R., & Gehrke, J. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339556 · Cited by 547
Metadata
- Authors
- Panda, B., Herbach, J. S., Basu, S., & Bayardo, R. J.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2009-08
- Volume
- 2
- Issue
- 2
- Pages
- 1426-1437
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2125816831
- Cited by
- 267
- References
- 34
- FWCI
- 47.67
- Type
- journal article
- 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.