TY - GEN
T1 - Maximum-margin framework for training data synchronization in large-scale hierarchical classification
AU - Babbar, Rohit
AU - Partalas, Ioannis
AU - Gaussier, Eric
AU - Amini, Massih Reza
N1 - 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)).
PY - 2013/11/3
Y1 - 2013/11/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84893356119&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-42054-2_42
DO - 10.1007/978-3-642-42054-2_42
M3 - Chapter in a published conference proceeding
AN - SCOPUS:84893356119
SN - 9783642420535
VL - 8826
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 336
EP - 343
BT - Neural Information Processing
PB - Springer Verlag
T2 - 20th International Conference on Neural Information Processing, ICONIP 2013
Y2 - 3 November 2013 through 7 November 2013
ER -