Low-rank regularization for sparse conjunctive feature spaces: An application to named entity classification

6Citations
Citations of this article
112Readers
Mendeley users who have this article in their library.

Abstract

Entity classification, like many other important problems in NLP, involves learning classifiers over sparse highdimensional feature spaces that result from the conjunction of elementary features of the entity mention and its context. In this paper we develop a low-rank regularization framework for training maxentropy models in such sparse conjunctive feature spaces. Our approach handles conjunctive feature spaces using matrices and induces an implicit low-dimensional representation via low-rank constraints. We show that when learning entity classifiers under minimal supervision, using a seed set, our approach is more effective in controlling model capacity than standard techniques for linear classifiers.

Cite

CITATION STYLE

APA

Primadhanty, A., Carreras, X., & Quattoni, A. (2015). Low-rank regularization for sparse conjunctive feature spaces: An application to named entity classification. In ACL-IJCNLP 2015 - 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, Proceedings of the Conference (Vol. 1, pp. 126–135). Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/p15-1013

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