Random k-Labelsets for Multilabel Classification
Aristotle University of Thessaloniki
Indexed incrossref
Abstract
A simple yet effective multilabel learning method, called label powerset (LP), considers each distinct combination of labels that exist in the training set as a different class value of a single-label classification task. The computational efficiency and predictive performance of LP is challenged by application domains with large number of labels and training examples. In these cases, the number of classes may become very large and at the same time many classes are associated with very few training examples. To deal with these problems, this paper proposes breaking the initial set of labels into a number of small random subsets, called labelsets and employing LP to train a corresponding classifier. The…
Citation impact
891
total citations
- FWCI
- 35.41
- Percentile
- 100%
- References
- 54
Citations per year
Authors
3Topics & keywords
Topics
Keywords
- Disjoint sets
- Computer science
- Classifier (UML)
- Multi-label classification
- Artificial intelligence
- Machine learning
- Construct (python library)
- Class (philosophy)
No related works found for this paper.