Hierarchical Classification using Binary Data
This work addresses classification challenges in domains with many hierarchical classes, but it appears incremental as it builds on an existing method.
The paper tackles hierarchical classification problems by extending a binary data classification approach to efficiently handle hierarchical data, showing computational and accuracy advantages when some classes are easier to identify.
In classification problems, especially those that categorize data into a large number of classes, the classes often naturally follow a hierarchical structure. That is, some classes are likely to share similar structures and features. Those characteristics can be captured by considering a hierarchical relationship among the class labels. Here, we extend a recent simple classification approach on binary data in order to efficiently classify hierarchical data. In certain settings, specifically, when some classes are significantly easier to identify than others, we showcase computational and accuracy advantages.