HC-Search for Multi-Label Prediction: An Empirical Study

Authors

  • Janardhan Rao Doppa Oregon State University
  • Jun Yu Oregon State University
  • Chao Ma Oregon State University
  • Alan Fern Oregon State University
  • Prasad Tadepalli Oregon State University

DOI:

https://doi.org/10.1609/aaai.v28i1.9021

Keywords:

Multi-Label Classification, Structured Prediction, Rank Learning, Learning for Search

Abstract

Multi-label learning concerns learning multiple, overlapping, and correlated classes. In this paper, we adapt a recent structured prediction framework called HC-Search for multi-label prediction problems. One of the main advantages of this framework is that its training is sensitive to the loss function, unlike the other multi-label approaches that either assume a specific loss function or require a manual adaptation to each loss function. We empirically evaluate our instantiation of the HC-Search framework along with many existing multi-label learning algorithms on a variety of benchmarks by employing diverse task loss functions. Our results demonstrate that the performance of existing algorithms tends to be very similar in most cases, and that the HC-Search approach is comparable and often better than all the other algorithms across different loss functions.

Downloads

Published

2014-06-21

How to Cite

Doppa, J. R., Yu, J., Ma, C., Fern, A., & Tadepalli, P. (2014). HC-Search for Multi-Label Prediction: An Empirical Study. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1). https://doi.org/10.1609/aaai.v28i1.9021

Issue

Section

Main Track: Novel Machine Learning Algorithms