Skip to Main content Skip to Navigation
Conference papers

On Flat versus Hierarchical Classification in Large-Scale Taxonomies

Abstract : We study in this paper flat and hierarchical classification strategies in the context of large-scale taxonomies. To this end, we first propose a multiclass, hierarchi-cal data dependent bound on the generalization error of classifiers deployed in large-scale taxonomies. This bound provides an explanation to several empirical results reported in the literature, related to the performance of flat and hierarchical classifiers. We then introduce another type of bound targeting the approximation error of a family of classifiers, and derive from it features used in a meta-classifier to decide which nodes to prune (or flatten) in a large-scale taxonomy. We finally illustrate the theoretical developments through several experiments conducted on two widely used taxonomies.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Massih-Reza Amini <>
Submitted on : Tuesday, February 24, 2015 - 1:56:13 PM
Last modification on : Monday, March 29, 2021 - 2:45:02 PM
Long-term archiving on: : Tuesday, May 26, 2015 - 5:35:24 PM


Files produced by the author(s)


  • HAL Id : hal-01118815, version 1



Rohit Babbar, Ioannis Partalas, Eric Gaussier, Massih-Reza Amini. On Flat versus Hierarchical Classification in Large-Scale Taxonomies. 27th Annual Conference on Neural Information Processing Systems (NIPS 26), Dec 2013, Lake Tao, United States. pp.1824--1832. ⟨hal-01118815⟩



Record views


Files downloads