Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 267

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

Panda, Biswanath, Herbach, Joshua S., Basu, Sugato, Bayardo, Roberto J.·2009·Proceedings of the VLDB Endowment

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.

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.14778/1687553.1687569

Cites

34 of 34 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

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 34 references

Cited by

See all 267

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: PLANET: massively parallel learning of tree ensembles with MapReduce. https://app.cochat.ai/papers/10.14778/1687553.1687569
The paper
Panda, B., Herbach, J. S., Basu, S., & Bayardo, R. J. (2009). PLANET: massively parallel learning of tree ensembles with MapReduce. Proceedings of the VLDB Endowment. https://doi.org/10.14778/1687553.1687569

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.