# VHT: Vertical Hoeffding Tree

arXiv: https://arxiv.org/abs/1607.08325 · HTML: https://mlsanity.com/paper/1607.08325/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Jul 2016.

## Built on by (most cited first, 2 of 2)

- [Green Accelerated Hoeffding Tree](https://mlsanity.com/paper/2205.03184/) (2022)
- [Scaling Probabilistic Circuits via Data Partitioning](https://mlsanity.com/paper/2503.08141/) (2025)

## Abstract (arXiv)

IoT Big Data requires new machine learning methods able to scale to large size of data arriving at high speed. Decision trees are popular machine learning models since they are very effective, yet easy to interpret and visualize. In the literature, we can find distributed algorithms for learning decision trees, and also streaming algorithms, but not algorithms that combine both features. In this paper we present the Vertical Hoeffding Tree (VHT), the first distributed streaming algorithm for learning decision trees. It features a novel way of distributing decision trees via vertical parallelism. The algorithm is implemented on top of Apache SAMOA, a platform for mining distributed data streams, and thus able to run on real-world clusters. We run several experiments to study the accuracy and throughput performance of our new VHT algorithm, as well as its ability to scale while keeping its superior performance with respect to non-distributed decision trees.