Classifier chains for multi-label classification
Jesse Read, Bernhard Pfahringer, Geoffrey Holmes, Eibe Frank
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.
What this paper cites, inside the corpus
What cites it, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| A Review on Multi-Label Learning Algorithms | 2013 | 3,375 |
| Ensemble deep learning: A review | 2022 | 2,136 |
Links
Topics
| Text and Document Classification Technologies | Computer Science |
| Machine Learning and Data Classification | Computer Science |
| Spam and Phishing Detection | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports4 author record(s) attached.
- supports52 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 86a6d6715ff540a0…