首页> 美国卫生研究院文献>BMC Bioinformatics >Optimizing graph-based patterns to extract biomedical events from the literature
【2h】

Optimizing graph-based patterns to extract biomedical events from the literature

机译:优化基于图的模式以从文献中提取生物医学事件

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In BioNLP-ST 2013We participated in the BioNLP 2013 shared tasks on event extraction. Our extraction method is based on the search for an approximate subgraph isomorphism between key context dependencies of events and graphs of input sentences. Our system was able to address both the GENIA (GE) task focusing on 13 molecular biology related event types and the Cancer Genetics (CG) task targeting a challenging group of 40 cancer biology related event types with varying arguments concerning 18 kinds of biological entities. In addition to adapting our system to the two tasks, we also attempted to integrate semantics into the graph matching scheme using a distributional similarity model for more events, and evaluated the event extraction impact of using paths of all possible lengths as key context dependencies beyond using only the shortest paths in our system. We achieved a 46.38% F-score in the CG task (ranking 3rd) and a 48.93% F-score in the GE task (ranking 4th).
机译:在BioNLP-ST 2013中,我们参加了BioNLP 2013在事件提取方面的共享任务。我们的提取方法是基于在事件的关键上下文依存关系和输入语句的图之间搜索近似子图同构的。我们的系统能够解决针对13种分子生物学相关事件类型的GENIA(GE)任务和针对40种与癌症生物学相关事件类型的挑战性组的具有挑战性的癌症遗传学(CG)任务,其中涉及18种生物实体。除了使我们的系统适应这两个任务之外,我们还尝试使用分布相似性模型将语义集成到图匹配方案中以处理更多事件,并评估了使用所有可能长度的路径作为关键上下文依赖项(而不是使用)的事件提取影响。只有我们系统中最短的路径。我们在CG任务中获得46.38%的F得分(排名3 rd ),在GE任务中获得48.93%的F得分(排名4 th )。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号