We explore the possibilities of meta-learning on data streams, in particular algorithm selection. In a first experiment we calculate the characteristics of a small sample of a data stream, and try to predict which classifier performs best on the entire stream. This yields promising results and interesting patterns. In a second experiment, we build a meta-classifier that predicts, based on measurable data characteristics in a window of the data stream, the best classifier for the next window. The results show that this meta-algorithm is very competitive with state of the art ensembles, such as OzaBag, OzaBoost and Leveraged Bagging. The results of all experiments are made publicly available in an online experiment database, for the purpose of verifiability, reproducibility and generalizability.
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|
|Congres||conference; 17th International Conference on Discovery Science; 2014-10-08; 2014-10-10|
|Periode||8/10/14 → 10/10/14|
|Ander||17th International Conference on Discovery Science|