An empirical study of empty prediction of multi-label classification
This is the first empirical study of empty prediction of multi-label classification. Every algorithm considered all made empty prediction on different datasets. HOMER and RAkEL have the overall lowest empty prediction rates in the study. Four thresholding methods which in theory can solve empty predictions are compared. Probabilistic thresholds are the best solution in terms of example based F1.
empty prediction multi-label classification