9 citations · 12 across the 17 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams
Hoang Ta, Hoa T. Vu
We establish nearly optimal upper and lower bounds for approximating decision tree splits in data streams. For regression with labels in the range , we give a one…
cs.DS2024
Constructing Decision Trees from Data Streams
Huy Pham, Hoang Ta, Hoa T. Vu
In this work, we present data stream algorithms to compute optimal splits for decision tree learning. In particular, given a data stream of observations \(x_i\) and their correspon…