Sciweavers

Share
SAC
2005
ACM

Learning decision trees from dynamic data streams

9 years 3 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental algorithm, which works online, processing each example in constant time, and performing a single scan over the training examples. It uses analytical techniques to choose the splitting criteria, and the information gain to estimate the merit of each possible splitting-test. For multi-class problems the algorithm builds a binary tree for each possible pair of classes, leading to a forest of trees. Decision nodes and leaves contain naive-Bayes classifiers playing different roles during the induction process. Naive-Bayes in leaves are used to classify test examples. Naive-Bayes in inner nodes play two different roles. They can be used as multivariate splitting-tests if chosen by the splitting criteria, and used to detect changes in the class-distribution of the examples that traverse the node. When a change in ...
João Gama, Pedro Medas, Pedro Pereira Rodri
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where SAC
Authors João Gama, Pedro Medas, Pedro Pereira Rodrigues
Comments (0)
books