Collective information extraction with relational Markov networks

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

Abstract

Most information extraction (IE) systems treat separate potential extractions as independent. However, in many cases, considering influences between different potential extractions could improve overall accuracy. Statistical methods based on undirected graphical models, such as conditional random fields (CRFs), have been shown to be an effective approach to learning accurate IE systems. We present a new IE method that employs Relational Markov Networks (a generalization of CRFs), which can represent arbitrary dependencies between extractions. This allows for "collective information extraction" that exploits the mutual influence between possible extractions. Experiments on learning to extract protein names from biomedical text demonstrate the advantages of this approach.

Cite

CITATION STYLE

APA

Bunescu, R., & Mooney, R. J. (2004). Collective information extraction with relational Markov networks. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 438–445). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1218955.1219011

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