Beyond global and local multi-target learning

Autor(es)

Basgalupp, Marcio ^[1] ; Cerri, Ricardo ^[2] ; Schietgat, Leander ^{[3, 4]} ; Triguero, Isaac ^[5] ; Vens, Celine ^[6]

Afiliação do(s) autor(es)

^[1] Univ Fed Sao Paulo, Inst Sci & Technol, Sao Jose Dos Campos, SP - Brazil

^[2] Univ Fed Sao Carlos, Dept Comp Sci, Sao Carlos, SP - Brazil

^[3] Katholieke Univ Leuven, Dept Comp Sci, Leuven - Belgium

^[4] Vrije Univ Brussel, Artificial Intelligence Lab, Brussels - Belgium

^[5] Univ Nottingham, Sch Comp Sci, Computat Optimisat & Learning COL Lab, Nottingham - England

^[6] KU Leuven Kulak, Dept Publ Hlth & Primary Care, Kortrijk - Belgium

• Tipo de documento: Artigo Científico
• Fonte: INFORMATION SCIENCES; v. 579, p. 508-524, NOV 2021.
• Citações Web of Science: 0

Resumo

In multi-target prediction, an instance has to be classified along multiple target variables at the same time, where each target represents a category or numerical value. There are several strategies to tackle multi-target prediction problems: the local strategy learns a separate model for each target variable independently, while the global strategy learns a single model for all target variables together. Previous studies suggested that the global strategy should be preferred because (1) learning is more efficient, (2) the learned models are more compact, and (3) it overfits much less than the local strategy, as it is harder to overfit on several targets at the same time than on one target. However, it is not clear whether the global strategy exploits correlations between the targets optimally. In this paper, we investigate whether better results can be obtained by learning multiple multi-target models on several partitions of the targets. To answer this question, we first determined alternative partitions using an exhaustive search strategy and a strategy based on a genetic algorithm, and then compared the results of the global and local strategies against these. We used decision trees and random forests as base models. The results show that it is possible to outperform global and local approaches, but finding a good partition without incurring in overfitting remains a challenging task. Crown Copyright (c) 2021 Published by Elsevier Inc. All rights reserved. (AU)

• Processo FAPESP: 16/02870-0 - Hiper-heurísticas multi-objetivas para construção automática de algoritmos de indução de árvores de decisão com múltiplos testes
• Beneficiário: Márcio Porto Basgalupp
• Modalidade de apoio: Auxílio à Pesquisa - Regular