Tesis doctoral de Albert Carles Bifet Figuerol
This thesis is devoted to the design of data mining algorithms for evolving data streams and for the extraction of closed frequent trees. First, we deal with each of these tasks separately, and then we deal with them together, developing classification methods for data streams containing items that are trees. in the data stream model, data arrive at high speed, and the algorithms that must process them have very strict constraints of space and time. In the first part of this thesis we propose and illustrate a framework for developing algorithms that can adaptively learn from data streams that change over time. Our methods are based on using change detectors and estimator modules at the right places. We propose an adaptive sliding window algorithm adwin for detecting change and keeping updated statistics from a data stream, and use it as a black-box in place or counters or accumulators in algorithms initially not designed for drifting data. Since adwin has rigorous performance guarantees, this opens the possibility of extending such guarantees to learning and mining algorithms. We test our methodology with several learning methods as naive bayes, clustering, decision trees and ensemble methods. We build an experimental framework for data stream mining with concept drift, based on the moa framework, similar to weka, so that it will be easy for researchers to run experimental data stream benchmarks. trees are connected acyclic graphs and they are studied as link-based structures in many cases. In the second part of this thesis, we describe a rather formal study of trees from the point of view of closure-based mining. Moreover, we present efficient algorithms for subtree testing and for mining ordered and unordered frequent closed trees. We include an analysis of the extraction of association rules of full confidence out of the closed sets of trees, and we have found there an interesting phenomenon: rules whose propositional counterpart is nontrivial are, however, always implicitly true in trees due to the peculiar combinatorics of the structures. and finally, using these results on evolving data streams mining and closed frequent tree mining, we present high performance algorithms for mining closed unlabeled rooted trees adaptively from data streams that change over time. We introduce a general methodology to identify closed patterns in a data stream, using galois lattice theory. Using this methodology, we then develop an incremental one, a sliding-window based one, and finally one that mines closed trees adaptively from data streams. We use these methods to develop classification methods for tree data streams.
Datos académicos de la tesis doctoral «Adaptive learning and mining for data streams and frequent patterns«
- Título de la tesis: Adaptive learning and mining for data streams and frequent patterns
- Autor: Albert Carles Bifet Figuerol
- Universidad: Politécnica de catalunya
- Fecha de lectura de la tesis: 24/04/2009
Dirección y tribunal
- Director de la tesis
- Ricard GavaldÁ Mestre
- Tribunal
- Presidente del tribunal: joost n. Kok
- joao Gama (vocal)
- christian Borgelt (vocal)
- mikos Garofalakis (vocal)