Abstract
In the context of supervised learning, the training data for large-scale hierarchical classification consist of (i) a set of input-output pairs, and (ii) a hierarchy structure defining parent-child relation among class labels. It is often the case that the hierarchy structure given a-priori is not optimal for achieving high classification accuracy. This is especially true for web-taxonomies such as Yahoo! directory which consist of tens of thousand of classes. Furthermore, an important goal of hierarchy design is to render better navigability and browsing. In this work, we propose a maximum-margin framework for automatically adapting the given hierarchy by using the set of input-output pairs to yield a new hierarchy. The proposed method is not only theoretically justified but also provides a more principled approach for hierarchy flattening techniques proposed earlier, which are ad-hoc and empirical in nature. The empirical results on publicly available large-scale datasets demonstrate that classification with new hierarchy leads to better or comparable generalization performance than the hierarchy flattening techniques.
Original language | English |
---|---|
Title of host publication | Neural Information Processing |
Subtitle of host publication | 20th International Conference, ICONIP 2013, Proceedings |
Publisher | Springer Verlag |
Pages | 336-343 |
Number of pages | 8 |
Volume | 8826 |
Edition | PART 1 |
ISBN (Electronic) | 9783642420542 |
ISBN (Print) | 9783642420535 |
DOIs | |
Publication status | Published - 3 Nov 2013 |
Event | 20th International Conference on Neural Information Processing, ICONIP 2013 - Daegu, Korea, Republic of Duration: 3 Nov 2013 → 7 Nov 2013 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Number | PART 1 |
Volume | 8226 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 20th International Conference on Neural Information Processing, ICONIP 2013 |
---|---|
Country/Territory | Korea, Republic of |
City | Daegu |
Period | 3/11/13 → 7/11/13 |
Bibliographical note
Funding details:This work was partly supported by the French National Research Agency (ANR), Class-Y project (ANR-10-BLAN-0211), and by the European Commission (EC), BioASQ project (FP7/2007-2013, ICT-2011.4.4(d)).
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science