Machine Learning

, 85:333

Classifier chains for multi-label classification

  • Jesse Read
  • Bernhard Pfahringer
  • Geoff Holmes
  • Eibe Frank
Article

DOI: 10.1007/s10994-011-5256-5

Cite this article as:
Read, J., Pfahringer, B., Holmes, G. et al. Mach Learn (2011) 85: 333. doi:10.1007/s10994-011-5256-5

Abstract

The widely known binary relevance method for multi-label classification, which considers each label as an independent binary problem, has often been overlooked in the literature due to the perceived inadequacy of not directly modelling label correlations. Most current methods invest considerable complexity to model interdependencies between labels. This paper shows that binary relevance-based methods have much to offer, and that high predictive performance can be obtained without impeding scalability to large datasets. We exemplify this with a novel classifier chains method that can model label correlations while maintaining acceptable computational complexity. We extend this approach further in an ensemble framework. An extensive empirical evaluation covers a broad range of multi-label datasets with a variety of evaluation metrics. The results illustrate the competitiveness of the chaining method against related and state-of-the-art methods, both in terms of predictive performance and time complexity.

Keywords

Multi-label classification Problem transformation Ensemble methods Scalable methods 
Download to read the full article text

Copyright information

© The Author(s) 2011

Authors and Affiliations

  • Jesse Read
    • 1
    • 2
  • Bernhard Pfahringer
    • 1
  • Geoff Holmes
    • 1
  • Eibe Frank
    • 1
  1. 1.Department of Computer ScienceThe University of WaikatoHamiltonNew Zealand
  2. 2.Department of Signal Theory and CommunicationsUniversidad Carlos IIIMadridSpain

Personalised recommendations