Data-Driven Hierarchical Open Set Recognition
Andrew Hannum, Max Conway, Mario Lopez, Andr\'e Harrison

TL;DR
This paper introduces a hierarchical open set recognition method that automatically constructs class hierarchies in embedding space using clustering, providing additional insights into unknown classes without extra relational data.
Contribution
It proposes a novel data-driven hierarchical OSR approach with new metrics and classification methods, enhancing unknown class understanding without requiring manual class relations.
Findings
Achieved an AUC ROC score of 0.82 on AwA2 dataset.
Introduced the Concentration Centrality (CC) metric for hierarchy consistency.
Provided two classification approaches: score-based and traversal-based.
Abstract
This paper presents a novel data-driven hierarchical approach to open set recognition (OSR) for robust perception in robotics and computer vision, utilizing constrained agglomerative clustering to automatically build a hierarchy of known classes in embedding space without requiring manual relational information. The method, demonstrated on the Animals with Attributes 2 (AwA2) dataset, achieves competitive results with an AUC ROC score of 0.82 and utility score of 0.85, while introducing two classification approaches (score-based and traversal-based) and a new Concentration Centrality (CC) metric for measuring hierarchical classification consistency. Although not surpassing existing models in accuracy, the approach provides valuable additional information about unknown classes through automatically generated hierarchies, requires no supplementary information beyond typical supervised…
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.
Taxonomy
TopicsNeural Networks and Applications
MethodsSparse Evolutionary Training
