用于联合事件关系提取的具有丰富事件结构的图传播模型

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2024-06-24 DOI:10.1016/j.ipm.2024.103811
Junchi Zhang , Tao Chen , Songtao Li , Ming Zhang , Yafeng Ren , Jun Wan
{"title":"用于联合事件关系提取的具有丰富事件结构的图传播模型","authors":"Junchi Zhang ,&nbsp;Tao Chen ,&nbsp;Songtao Li ,&nbsp;Ming Zhang ,&nbsp;Yafeng Ren ,&nbsp;Jun Wan","doi":"10.1016/j.ipm.2024.103811","DOIUrl":null,"url":null,"abstract":"<div><p>The task of event relation extraction (ERE) aims to organize multiple events and their relations as a directed graph. However, existing ERE methods exhibit two limitations: (1) Events in a document are typically expressed with merely a trigger word or phrase neglecting the rich semantic structure of event arguments and roles. (2) Various event relations such as coreference, temporal, causal, and subevent relations are correlated with each other, while little work has explored the benefits of extracting all relations in a joint manner. In this work, we investigate an event-relation graph propagation network and a novel document-level semantically-enriched event representation for joint ERE. First, we address the lack of event argument annotations by extracting cross-sentence implicit arguments based on the AMR graph. Then triggers and argument roles are aggregated with a structure-aware encoder. Second, based on the rich event information, event relation interactions are incorporated with a subgraph propagation and aggregation mechanism. During training, we further develop a novel triadic contrastive loss to capture high-order event pair relationships. We conduct experiments based on the public MAVEN-ERE benchmark and the results show that our model achieves 60.7%, 37.4%, 32.9% F1-scores on temporal, causal and subevent relations, and 86.1% MUC-score on coreferences, outperforming the current joint models by a large margin. Further in-depth analysis shows the effectiveness of our model in capturing event-event dependencies in document context. The proposed model can be used for event graph construction and storyline understanding.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4000,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A graph propagation model with rich event structures for joint event relation extraction\",\"authors\":\"Junchi Zhang ,&nbsp;Tao Chen ,&nbsp;Songtao Li ,&nbsp;Ming Zhang ,&nbsp;Yafeng Ren ,&nbsp;Jun Wan\",\"doi\":\"10.1016/j.ipm.2024.103811\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The task of event relation extraction (ERE) aims to organize multiple events and their relations as a directed graph. However, existing ERE methods exhibit two limitations: (1) Events in a document are typically expressed with merely a trigger word or phrase neglecting the rich semantic structure of event arguments and roles. (2) Various event relations such as coreference, temporal, causal, and subevent relations are correlated with each other, while little work has explored the benefits of extracting all relations in a joint manner. In this work, we investigate an event-relation graph propagation network and a novel document-level semantically-enriched event representation for joint ERE. First, we address the lack of event argument annotations by extracting cross-sentence implicit arguments based on the AMR graph. Then triggers and argument roles are aggregated with a structure-aware encoder. Second, based on the rich event information, event relation interactions are incorporated with a subgraph propagation and aggregation mechanism. During training, we further develop a novel triadic contrastive loss to capture high-order event pair relationships. We conduct experiments based on the public MAVEN-ERE benchmark and the results show that our model achieves 60.7%, 37.4%, 32.9% F1-scores on temporal, causal and subevent relations, and 86.1% MUC-score on coreferences, outperforming the current joint models by a large margin. Further in-depth analysis shows the effectiveness of our model in capturing event-event dependencies in document context. The proposed model can be used for event graph construction and storyline understanding.</p></div>\",\"PeriodicalId\":50365,\"journal\":{\"name\":\"Information Processing & Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.4000,\"publicationDate\":\"2024-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing & Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0306457324001705\",\"RegionNum\":1,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324001705","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

事件关系提取(ERE)任务旨在将多个事件及其关系组织成一个有向图。然而,现有的ERE 方法有两个局限性:(1) 文档中的事件通常只用一个触发词或短语来表达,忽略了事件参数和角色的丰富语义结构。(2) 各种事件关系(如核心参照关系、时间关系、因果关系和子事件关系)之间相互关联,而很少有人探索以联合方式提取所有关系的益处。在这项工作中,我们研究了一种事件关系图传播网络和一种用于联合ERE的新型文档级语义丰富事件表示法。首先,我们根据 AMR 图提取跨句子隐含参数,解决了缺乏事件参数注释的问题。然后使用结构感知编码器聚合触发器和参数角色。其次,基于丰富的事件信息,利用子图传播和聚合机制将事件关系交互纳入其中。在训练过程中,我们进一步开发了一种新颖的三元组对比损失,以捕捉高阶事件对关系。我们基于公开的 MAVEN-ERE 基准进行了实验,结果表明我们的模型在时间关系、因果关系和子事件关系上分别获得了 60.7%、37.4% 和 32.9% 的 F1 分数,在核心参照关系上获得了 86.1% 的 MUC 分数,大大优于当前的联合模型。进一步的深入分析表明,我们的模型能有效捕捉文档上下文中的事件-事件依赖关系。所提出的模型可用于事件图构建和故事情节理解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A graph propagation model with rich event structures for joint event relation extraction

The task of event relation extraction (ERE) aims to organize multiple events and their relations as a directed graph. However, existing ERE methods exhibit two limitations: (1) Events in a document are typically expressed with merely a trigger word or phrase neglecting the rich semantic structure of event arguments and roles. (2) Various event relations such as coreference, temporal, causal, and subevent relations are correlated with each other, while little work has explored the benefits of extracting all relations in a joint manner. In this work, we investigate an event-relation graph propagation network and a novel document-level semantically-enriched event representation for joint ERE. First, we address the lack of event argument annotations by extracting cross-sentence implicit arguments based on the AMR graph. Then triggers and argument roles are aggregated with a structure-aware encoder. Second, based on the rich event information, event relation interactions are incorporated with a subgraph propagation and aggregation mechanism. During training, we further develop a novel triadic contrastive loss to capture high-order event pair relationships. We conduct experiments based on the public MAVEN-ERE benchmark and the results show that our model achieves 60.7%, 37.4%, 32.9% F1-scores on temporal, causal and subevent relations, and 86.1% MUC-score on coreferences, outperforming the current joint models by a large margin. Further in-depth analysis shows the effectiveness of our model in capturing event-event dependencies in document context. The proposed model can be used for event graph construction and storyline understanding.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
期刊最新文献
Fusing temporal and semantic dependencies for session-based recommendation A Universal Adaptive Algorithm for Graph Anomaly Detection A context-aware attention and graph neural network-based multimodal framework for misogyny detection Multi-granularity contrastive zero-shot learning model based on attribute decomposition Asymmetric augmented paradigm-based graph neural architecture search
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1