Meta-learning for Periodic Algorithms Selection in Time-changing Data

Learning When to Simplify Sentences for Natural Text Simplification

André L. D. RossiAndré C. P. L. F. de CarvalhoCarlos Soares

When a learning algorithm is selected to induce a model for a dataset, a common practice is to choose an algorithm whose bias suits the data distribution. However, in real-world applications that produce data continuously, this distribution may change over time. Thus, a learning algorithm with the adequate bias for a dataset, may become unsuitable when new data, following a different distribution, is received. In this paper we present a meta-learning approach for periodic algorithms selection when data distribution may change over time. This approach exploits the knowledge obtained from the induction of models for different data chunks to improve the general predictive performance. It periodically applies a meta-classifier to predict the most appropriate learning algorithm for new unlabeled data. Characteristics extracted from past and incoming data, together with the predictive performance from different models, constitute the meta-data, which is used to induce this meta-classifier. Experimental results using data for a travel time prediction problem show its ability to improve the general performance of the learning system. Moreover, the proposed approach can be applied to other time-changing tasks, since it is domain independent. Caroline GasperinLucia SpeciaTiago F. PereiraSandra Maria Aluísio

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: