Fast recursive multi-class classification of pairs of text entities for biomedical event extraction - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Fast recursive multi-class classification of pairs of text entities for biomedical event extraction

Abstract

Extracting biomedical events from scientific articles to automatically update dedicated knowledge bases has become a popular research topic with important applications. Most existing approaches are either pipeline models of specific classifiers, usually subject to cascading errors, or joint structured models, more efficient but also more costly and complicated to train. This paper proposes a system based on a pairwise model that transforms event extraction into a simple multi-class problem of classifying pairs of text entities. Such pairs are recursively provided to the classifier, allowing to extract events involving other events as arguments. This model facilitates inference compared to joint models while % relying on a single main classifier compared to being more direct and efficient than usual pipeline approaches. This method yields the best results reported so far on the BioNLP 2011 and 2013 Genia tasks.
Fichier principal
Vignette du fichier
document.pdf (323.62 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01060830 , version 1 (04-09-2014)

Identifiers

  • HAL Id : hal-01060830 , version 1

Cite

Xiao Liu, Antoine Bordes, Yves Grandvalet. Fast recursive multi-class classification of pairs of text entities for biomedical event extraction. Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, Apr 2014, Gothenburg, Sweden. pp.692--701. ⟨hal-01060830⟩
309 View
125 Download

Share

Gmail Facebook Twitter LinkedIn More