Read, JessePfahringer, BernhardHolmes, GeoffreyFrank, Eibe2024-01-182024-01-182011-12-010885-6125https://hdl.handle.net/10289/16357The 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.application/pdfEnglishThis is an author’s accepted version of an article published in Machine Learning. © 2011 Springer.Science & TechnologyTechnologyComputer Science, Artificial IntelligenceComputer ScienceMulti-label classificationProblem transformationEnsemble methodsScalable methodsJournal Article10.1007/s10994-011-5256-51573-0565