A simple approach to incorporate label dependency in multi-label classification

  • Authors:
  • Everton Alvares Cherman;Jean Metz;Maria Carolina Monard

  • Affiliations:
  • Institute of Mathematics and Computer Science, University of São Paulo at São Carlos, São Carlos, SP, Brazil;Institute of Mathematics and Computer Science, University of São Paulo at São Carlos, São Carlos, SP, Brazil;Institute of Mathematics and Computer Science, University of São Paulo at São Carlos, São Carlos, SP, Brazil

  • Venue:
  • MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In multi-label classification, each example can be associated with multiple labels simultaneously. The task of learning from multilabel 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 multilabel 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. In this paper, we consider a simple approach which can be used to explore labels dependency aiming to accurately predict label combinations. An experimental study using decision trees, a kernel method as well as Naïve Bayes as base-learning techniques shows the potential of the proposed approach to improve the multi-label classification performance.