TL;DR
This paper introduces Dynamic Model Trees, a novel online learning framework for data streams that offers improved interpretability, efficiency, and adaptability to concept drift compared to traditional Hoeffding Trees.
Contribution
The paper presents the Dynamic Model Tree framework, which enhances interpretability and reduces complexity in data stream learning while effectively handling concept drift.
Findings
Reduces the number of splits compared to existing incremental decision trees.
Often outperforms state-of-the-art models in predictive quality.
Maintains more flexible and locally robust representations of data concepts.
Abstract
Data streams are ubiquitous in modern business and society. In practice, data streams may evolve over time and cannot be stored indefinitely. Effective and transparent machine learning on data streams is thus often challenging. Hoeffding Trees have emerged as a state-of-the art for online predictive modelling. They are easy to train and provide meaningful convergence guarantees under a stationary process. Yet, at the same time, Hoeffding Trees often require heuristic and costly extensions to adjust to distributional change, which may considerably impair their interpretability. In this work, we revisit Model Trees for machine learning in evolving data streams. Model Trees are able to maintain more flexible and locally robust representations of the active data concept, making them a natural fit for data stream applications. Our novel framework, called Dynamic Model Tree, satisfies…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
