.png){kind=icon}
Return
Classifier chains for multi-label classification
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-011-5256-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.4W
Organization
Cited Papers
Morphology and properties of melt-spun polycarbonate fibers containing single- and multi-wall carbon nanotubes.png)
Polymer
PolymerIF0
PREAI
ShareSaveShareSave
ShareSave
View more