Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Hoeffding Trees"”.
-
Improving Hoeffding Trees
… incrementally updated classification model. The Hoeffding tree algorithm is a state-of-the-art method for inducing decision trees from data streams. The aim of this thesis is to improve this algorithm. To measure improvement, a comprehensive framework for evaluating the performance of data stream …
-
Monitoring data streams
… part of the thesis, we present Probabilistic Hoeffding Trees, a novel approach towards stream classification. We will show how probabilistic learning greatly improves the flexibility of decision trees and their ability to adapt to changes in data streams. The general technique is applicable to …
-
Capturing Recurring Concepts in High Speed Data Streams
… change detectors to locate concept boundaries, a Hoeffding tree compressor to exploit the application of Discrete Fourier Transform on Decision Trees to produce compact Fourier Spectra, a forest of Hoeffding Trees to actively learn and a pool of Fourier spectra to be reused on similar recurring …
-
Hoeffding-Tree-Based Learning from Data Streams and Its Application in Online Voltage Security Assessment
… (PDCs). Periodically updated decision trees (DTs) have been applied in different subjects of security assessments in power systems. However, with a training data set of operating conditions that grows rapidly, re-training and restructuring a decision tree becomes a time-consuming …