VHT: Vertical Hoeffding Tree

July 28, 2016 Β· Declared Dead Β· πŸ› 2016 IEEE International Conference on Big Data (Big Data)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nicolas Kourtellis, Gianmarco De Francisci Morales, Albert Bifet, Arinto Murdopo arXiv ID 1607.08325 Category cs.DC: Distributed Computing Cross-listed cs.AI, cs.DB Citations 52 Venue 2016 IEEE International Conference on Big Data (Big Data) Last Checked 5 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted