Multi-Target Regression from High-Speed Data Streams with Adaptive Model Rules

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2015

Autores

Duarte, J (Autor) Outra; João Gama (Autor) FEP

Ata de Conferência Internacional

Título: PROCEEDINGS OF THE 2015 IEEE INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (IEEE DSAA 2015)

Páginas: 1080-1089

Proceedings of the 2015 IEEE International Conference on Data Science and Advanced Analytics (IEEE DSAA 2015)

IEEE, PARIS, FRANCE, OCT 19-21, 2015

Indexação

ISI Web of Knowledge - 5 Citações

Scopus - 15 Citações

Outras Informações

ID Authenticus: P-00K-AN0

DOI: 10.1109/DSAA.2015.7344900

Abstract (EN): Many real life prediction problems involve predicting a structured output. Multi-target regression is an instance of structured output prediction whose task is to predict for multiple target variables. Structured output algorithms are usually computationally and memory demanding, hence are not suited for dealing with massive amounts of data. Most of these algorithms can be categorized as local or global methods. Local methods produce individual models for each output component and combine them to produce the structured prediction. Global methods adapt traditional learning algorithms to predict the output structure as a whole. We propose the first rule-based algorithm for solving multi-target regression problems from data streams. The algorithm builds on the adaptive model rules framework. In contrast to the majority of the structured output predictors, this particular algorithm does not fall into the local and global categories. Instead, each rule specializes on related subsets of the output attributes. To evaluate the performance of the proposed algorithm, two other rule-based algorithms were developed, one using the local strategy and the other using the global strategy. These methods were compared considering their prediction error, memory usage, computational time, and model complexity. Experimental results on synthetic and real data show that the local-strategy algorithm usually obtains the lowest error. However, the proposed and the global-strategy algorithms use much less memory and run significantly much faster at the cost of a slightly increase in the error, which make them very attractive when computation resources are an important factor. Also, the models produced by the latter approaches are much easier to understand since considerably less rules are produced.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 10