- Poster presentation
- Open Access
A fast and effective dependency graph kernel for PPI relation extraction
© Tikk et al; licensee BioMed Central Ltd. 2010
- Published: 06 October 2010
- Dependency Graph
- Tree Parse
- Biomedical Text
- Graph Kernel
- Tree Kernel
Extraction of protein-protein interactions (PPIs) reported in scientific publications is a core topic of biomedical text mining. The ultimate goal is to devise a PPI extraction method that performs well on large amount of unseen text independently from the training corpus. One popular, machine-learning based approach to PPI extraction builds on the convolution kernels, i.e., similarity functions defined on the parse-based representation of sentences and interactions. Kernel functions differ in (1) the underlying sentence representation (bag-of-words, syntax tree parse, dependency graphs), (2) the substructures retrieved from the sentence representation to define interactions, and (3) calculation of the similarity function.
We present a novel kernel method called k-band shortest path spectrum kernel (kBSPS), an extension of the spectrum tree kernel (SpT) . It combines three ideas: First, interactions are represented as vertex-walks as in SpT but adapted to dependency graphs. The kBSPS kernel includes also edge labels into vertex-walks, thus also exploiting the dependency type of a relationship. Second, it uses a novel similarity function on vertex-walks permitting certain mismatches, thus allowing for linguistic variations. The tolerant matching distinguishes three types of nodes: dependency types (D), candidate entities (E), and other surface tokens (L). Mismatches / matches are scored differently depending on the type of nodes. Third, apart from the shortest path between the proteins of the candidate interaction, kBSPS also adds all nodes within distance k from this path to the vertex-walk representation.
Comparison of kBSPS in terms of AUC, F1-measure and classification time with other state-of-the-art kernels using the CV and CL evaluation scenarios
We have shown that kBSPS kernel is on par with state-of-the-art kernels at the more general CL evaluation. Furthermore, its performance is more stable (drops the least from CV) than other methods. Notably, kBSPS is also much faster than any other kernel, making it applicable to very large corpora.
Domonkos Tikk was supported by the Alexander-von-Humboldt Foundation.
- Kuboyama T, Hirata K, Kashima H, Aoki-Kinoshita KF, Yasuda H: A spectrum tree kernel. Information and Media Technologies 2007, 2: 292–299.Google Scholar
- Giuliano C, Lavelli A, Romano L: Exploiting shallow linguistic information for relation extraction from biomedical literature. Proc. of the 11st Conf. of the European Chapter of the Association for Computational Linguistics (EACL'06) Trento, Italy: The Association for Computer Linguistics; 2006, 401–408. [http://acl.ldc.upenn.edu/E/E06/E06–1051.pdf]Google Scholar
- Airola A, Pyysalo S, Björne J, Pahikkala T, Ginter F, et al.: All-paths graph kernel for protein-protein interaction extraction with evaluation of cross-corpus learning. BMC Bioinformatics 2008, 9(Suppl 11):S2. 10.1186/1471-2105-9-S11-S2PubMed CentralView ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd.