skip to main content
10.1145/3041021.3054204acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
poster

Learning Extreme Multi-label Tree-classifier via Nearest Neighbor Graph Partitioning

Published:03 April 2017Publication History

ABSTRACT

Web scale classification problems, such as Web page tagging and E-commerce product recommendation, are typically regarded as multi-label classification with an extremely large number of labels. In this paper, we propose GPT, which is a novel tree-based approach for extreme multi-label learning. GPT recursively splits a feature space with a hyperplane at each internal node, considering approximate k-nearest neighbor graph on the label space. We learn the linear binary classifiers using a simple optimization procedure. We conducted evaluations on several large-scale real-world data sets and compared our proposed method with recent state-of-the-art methods. Experimental results demonstrate the effectiveness of our proposed method.

References

  1. J. Duchi, E. Hazan, and Y. Singer. Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res., 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. H. Jain, Y. Prabhu, and M. Varma. Extreme multi-label loss functions for recommendation, tagging, ranking & other missing label applications. In KDD, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. K. Jasinska, K. Dembczy\'nski, R. Busa-Fekete, K. Pfannschmidt, T. Klerx, and E. Hüllermeier. Extreme f-measure maximization using sparse probability estimates. In ICML, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. H. B. McMahan. Follow-the-regularized-leader and mirror descent: Equivalence theorems and l1 regularization. In AISTATS, 2011.Google ScholarGoogle Scholar
  5. Y. Prabhu and M. Varma. FastXML: A fast, accurate and stable tree-classifier for extreme multi-label learning. In KDD, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Learning Extreme Multi-label Tree-classifier via Nearest Neighbor Graph Partitioning

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader