Hierarchical Classification using Binary Data
Denali Molitor, Deanna Needell

TL;DR
This paper presents an extension of a binary data classification method that leverages hierarchical class structures to improve efficiency and accuracy, especially when some classes are easier to identify.
Contribution
It introduces a hierarchical classification approach for binary data, enhancing computational efficiency and accuracy in large, structured class sets.
Findings
Improved classification accuracy for hierarchical data
Enhanced computational efficiency in certain settings
Effective when some classes are easier to identify
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
