On Dataless Hierarchical Text Classification

Authors

  • Yangqiu Song University of Illinois at Urbana-Champaign
  • Dan Roth University of Illinois at Urbana-Champaign

DOI:

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

Keywords:

text classification, semantic representation, dataless classification

Abstract

In this paper, we systematically study the problem of dataless hierarchical text classification. Unlike standard text classification schemes that rely on supervised training, dataless classification depends on understanding the labels of the sought after categories and requires no labeled data. Given a collection of text documents and a set of labels, we show that understanding the labels can be used to accurately categorize the documents. This is done by embedding both labels and documents in a semantic space that allows one to compute meaningful semantic similarity between a document and a potential label. We show that this scheme can be used to support accurate multiclass classification without any supervision. We study several semantic representations and show how to improve the classification using bootstrapping. Our results show that bootstrapped dataless classification is competitive with supervised classification with thousands of labeled examples.

Downloads

Published

2014-06-21

How to Cite

Song, Y., & Roth, D. (2014). On Dataless Hierarchical Text Classification. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1). https://doi.org/10.1609/aaai.v28i1.8938