Artículos de revistas
Incorporating label dependency into the binary relevance framework for multi-label classification
Date
2012Registration in:
EXPERT SYSTEMS WITH APPLICATIONS, OXFORD, v. 39, n. 2, pp. 1647-1655, FEB 1, 2012
0957-4174
10.1016/j.eswa.2011.06.056
Author
Alvares-Cherman, Everton
Metz, Jean
Monard, Maria Carolina
Institutions
Abstract
In multi-label classification, examples can be associated with multiple labels simultaneously. The task of learning from multi-label data can be addressed by methods that transform the multi-label classification problem into several single-label classification problems. The binary relevance approach is one of these methods, where the multi-label learning task is decomposed into several independent binary classification problems, one for each label in the set of labels, and the final labels for each example are determined by aggregating the predictions from all binary classifiers. However, this approach fails to consider any dependency among the labels. Aiming to accurately predict label combinations, in this paper we propose a simple approach that enables the binary classifiers to discover existing label dependency by themselves. An experimental study using decision trees, a kernel method as well as Naive Bayes as base-learning techniques shows the potential of the proposed approach to improve the multi-label classification performance.