pdsCART is described as a MapReduce parallelization of dsCART, claimed to produce identical trees at lower runtime, but the supporting experiments are not reproducible.
So cial networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Review and Analysis of a Parallel Approach for Decision Tree Learning from Large Data Streams
pdsCART is described as a MapReduce parallelization of dsCART, claimed to produce identical trees at lower runtime, but the supporting experiments are not reproducible.