A graph Kernel for protein-protein interaction extraction

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

Abstract

In this paper, we propose a graph kernel based approach for the automated extraction of protein-protein interactions (PPI) from scientific literature. In contrast to earlier approaches to PPI extraction, the introduced alldependency- paths kernel has the capability to consider full, general dependency graphs. We evaluate the proposed method across five publicly available PPI corpora providing the most comprehensive evaluation done for a machine learning based PPI-extraction system. Our method is shown to achieve state-of-the art performance with respect to comparable evaluations, achieving 56.4 F-score and 84.8 AUC on the AI med corpus. Further, we identify several pitfalls that can make evaluations of PPI-extraction systems incomparable, or even invalid. These include incorrect crossvalidation strategies and problems related to comparing F-score results achieved on different evaluation resources.

Cite

CITATION STYLE

APA

Airola, A., Pyysalo, S., Björne, J., Pahikkala, T., Ginter, F., & Salakoski, T. (2008). A graph Kernel for protein-protein interaction extraction. In BioNLP 2008 - Current Trends in Biomedical Natural Language Processing, Proceedings of the Workshop (pp. 1–9). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1572306.1572308

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