EXPLORING A SUBGRAPH MATCHING APPROACH FOR EXTRACTING BIOLOGICAL EVENTS FROM LITERATURE. (1st April 2013)

• Record Type: Journal Article
• Authors: Liu, Haibin; Kešelj, Vlado; Blouin, Christian
• Is Part Of: Computational intelligence. Volume 30:Number 3(2014:Aug.)
• Page Start: 600
• Page End: 635
• Publication Date: 2013-04-01
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12009
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" id="coin12009-abs-0001"> <title> <x xml:space="preserve">Abstract</x> </title> <p>An important task in biological information extraction is to identify descriptions of biological relations and events involving genes or proteins. In this work, we propose a graph‐based approach to automatically learn rules for detecting biological events in the life science literature. The event rules are learned by identifying the key contextual dependencies from full parsing of annotated text. The detection is performed by searching for isomorphism between event rules and the dependency graphs of complete sentences. When applying our approach to the data sets of the Task 1 of the BioNLP‐ST 2009, we achieved a 40.71% <italic>F</italic>‐score in detecting biological events across nine event types. Our 56.32% precision is comparable with the state‐of‐the‐art systems. The approach may also be generalized to extract events from other domains where training data are available because it requires neither manual intervention nor external domain‐specific resources. The subgraph matching algorithm we developed is released under the new BSD license and can be downloaded from <ext-link ext-link-type="uri" xlink:href="http://esmalgorithm.sourceforge.net" xlink:type="simple" xmlns:xlink="http://www.w3.org/1999/xlink">http://esmalgorithm.sourceforge.net</ext-link>.</p> </abstract>