Junchi Zhang , Tao Chen , Songtao Li , Ming Zhang , Yafeng Ren , Jun Wan
{"title":"A graph propagation model with rich event structures for joint event relation extraction","authors":"Junchi Zhang , Tao Chen , Songtao Li , Ming Zhang , Yafeng Ren , 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}
引用次数: 0
Abstract
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 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.