Sprinkling topics for weakly supervised text classification

10Citations
Citations of this article
111Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Supervised text classification algorithms require a large number of documents labeled by humans, that involve a laborintensive and time consuming process. In this paper, we propose a weakly supervised algorithm in which supervision comes in the form of labeling of Latent Dirichlet Allocation (LDA) topics. We then use this weak supervision to "sprinkle" artificial words to the training documents to identify topics in accordance with the underlying class structure of the corpus based on the higher order word associations. We evaluate this approach to improve performance of text classification on three real world datasets. © 2014 Association for Computational Linguistics.

Cite

CITATION STYLE

APA

Hingmire, S., & Chakraborti, S. (2014). Sprinkling topics for weakly supervised text classification. In 52nd Annual Meeting of the Association for Computational Linguistics, ACL 2014 - Proceedings of the Conference (Vol. 2, pp. 55–60). Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/p14-2010

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free