BoostVHT: Boosting distributed streaming decision trees
2017 (English)In: International Conference on Information and Knowledge Management, Proceedings, 2017, p. 899-908Conference paper, Published paper (Refereed)
Abstract [en]
Online boosting improves the accuracy of classifiers for unbounded streams of data by chaining them into an ensemble. Due to its sequential nature, boosting has proven hard to parallelize, even more so in the online setting. This paper introduces BoostVHT, a technique to parallelize online boosting algorithms. Our proposal leverages a recently-developed model-parallel learning algorithm for streaming decision trees as a base learner. This design allows to neatly separate the model boosting from its training. As a result, BoostVHT provides a flexible learning framework which can employ any existing online boosting algorithm, while at the same time it can leverage the computing power of modern parallel and distributed cluster environments. We implement our technique on Apache SAMOA, an open-source platform for mining big data streams that can be run on several distributed execution engines, and demonstrate order of magnitude speedups compared to the state-of-the-art. © 2017 Copyright held by the owner/author(s).
Place, publisher, year, edition, pages
2017. p. 899-908
Keywords [en]
Boosting, Decision trees, Distributed systems, Online learning, Big data, Cluster computing, Clustering algorithms, Data mining, Distributed computer systems, Forestry, Knowledge management, Online systems, Trees (mathematics), Distributed clusters, Distributed streaming, Flexible Learning, Open source platforms, Parallel learning algorithms, Learning algorithms
National Category
Natural Sciences
Identifiers
URN: urn:nbn:se:ri:diva-33210DOI: 10.1145/3132847.3132974Scopus ID: 2-s2.0-85037345394ISBN: 9781450349185 (print)OAI: oai:DiVA.org:ri-33210DiVA, id: diva2:1179210
Conference
26th ACM International Conference on Information and Knowledge Management, CIKM 2017, 6 November 2017 through 10 November 2017
2018-01-312018-01-312018-08-13Bibliographically approved