We describe a new approach for classification with a very large number of classes where we assume some class similarity information is available, e.g. through a hierarchical organization. The proposed method learns a compact binary code using such an existing similarity information defined on classes. Binary classifiers are then trained using this code and decoding is performed using a simple nearest neighbor rule. This strategy, related to Error Correcting Output Codes methods, is shown to perform similarly or better than the standard and efficient one-vs-all approach, with much lower inference complexity. © 2012 Springer-Verlag.
CITATION STYLE
Cissé, M., Artières, T., & Gallinari, P. (2012). Learning compact class codes for fast inference in large multi class classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7523 LNAI, pp. 506–520). https://doi.org/10.1007/978-3-642-33460-3_38
Mendeley helps you to discover research relevant for your work.