Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Fast multi-label core vector machine
Pattern Recognition
Learning and inference in probabilistic classifier chains with beam search
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Tag recommendation in software information sites
Proceedings of the 10th Working Conference on Mining Software Repositories
Beam search algorithms for multilabel learning
Machine Learning
A study on multi-label classification
ICDM'13 Proceedings of the 13th international conference on Advances in Data Mining: applications and theoretical aspects
An ensemble of Bayesian networks for multilabel classification
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Dependent binary relevance models for multi-label classification
Pattern Recognition
Information Sciences: an International Journal
Multi-label classification by exploiting label correlations
Expert Systems with Applications: An International Journal
Random block coordinate descent method for multi-label support vector machine with a zero label
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
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.