Hierarchical multilabel classification (HMC) is a variant of classification where instances may belong to multiple classes organized in a hierarchy. The task is relevant for several application domains. This paper presents an empirical study of decision tree approaches to HMC in the area of functional genomics. We compare learning a single HMC tree (which makes predictions for all classes together) to learning a set of regular classification trees (one for each class). Interestingly, on all 12 datasets we use, the HMC tree wins on all fronts: it is faster to learn and to apply, easier to interpret, and has similar or better predictive performance than the set of regular trees. It turns out that HMC tree learning is more robust to overfitting than regular tree learning.
|Title of host publication||Knowledge Discovery in Databases|
|Subtitle of host publication||PKDD 2006|
|Number of pages||12|
|ISBN (Print)||978-3-540-45374-1, 978-3-540-46048-0|
|Publication status||Published - 2006|