A Robust Joint-Training Graph Neural Networks Model for Event Detection with Symmetry and Asymmetry Noisylabels

Mingxiang Li, Huang Xing, Tengyun Wang, Jiaxuan Dai, Kaiming Xiao
{"title":"A Robust Joint-Training Graph Neural Networks Model for Event Detection with Symmetry and Asymmetry Noisylabels","authors":"Mingxiang Li, Huang Xing, Tengyun Wang, Jiaxuan Dai, Kaiming Xiao","doi":"10.5121/ijnlc.2023.12209","DOIUrl":null,"url":null,"abstract":"Events are the core element of information in descriptive corpus. Although many progresses have beenmade in Event Detection (ED), it is still a challenge in Natural Language Processing (NLP) to detect event information from data with unavoidable noisy labels. A robust Joint-training Graph ConvolutionNetworks (JT-GCN) model is proposed to meet the challenge of ED tasks with noisy labels in this paper. Specifically, we first employ two Graph Convolution Networks with Edge Enhancement (EE-GCN) tomake predictions simultaneously. A joint loss combining the detection loss and the contrast loss fromtwonetworks is then calculated for training. Meanwhile, a small-loss selection mechanism is introduced tomitigate the impact of mislabeled samples in networks training process. These two networks gradually reach an agreement on the ED tasks as joint-training progresses. Corrupted data with label noise are generated from the benchmark dataset ACE2005. Experiments on ED tasks has been conducted with bothsymmetry and asymmetry label noise on dif erent level. The experimental results show that the proposedmodel is robust to the impact of label noise and superior to the state-of-the-art models for EDtasks.","PeriodicalId":179392,"journal":{"name":"International Journal on Natural Language Computing","volume":"148 1-2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal on Natural Language Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/ijnlc.2023.12209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Events are the core element of information in descriptive corpus. Although many progresses have beenmade in Event Detection (ED), it is still a challenge in Natural Language Processing (NLP) to detect event information from data with unavoidable noisy labels. A robust Joint-training Graph ConvolutionNetworks (JT-GCN) model is proposed to meet the challenge of ED tasks with noisy labels in this paper. Specifically, we first employ two Graph Convolution Networks with Edge Enhancement (EE-GCN) tomake predictions simultaneously. A joint loss combining the detection loss and the contrast loss fromtwonetworks is then calculated for training. Meanwhile, a small-loss selection mechanism is introduced tomitigate the impact of mislabeled samples in networks training process. These two networks gradually reach an agreement on the ED tasks as joint-training progresses. Corrupted data with label noise are generated from the benchmark dataset ACE2005. Experiments on ED tasks has been conducted with bothsymmetry and asymmetry label noise on dif erent level. The experimental results show that the proposedmodel is robust to the impact of label noise and superior to the state-of-the-art models for EDtasks.
一种具有对称和不对称噪声标签的鲁棒联合训练图神经网络模型
事件是描述性语料库中信息的核心要素。尽管事件检测(ED)已经取得了许多进展,但如何从带有不可避免的噪声标签的数据中检测出事件信息仍然是自然语言处理(NLP)中的一个挑战。针对带噪声标签ED任务的挑战,提出了一种鲁棒联合训练图卷积网络(JT-GCN)模型。具体来说,我们首先使用两个带有边缘增强的图卷积网络(EE-GCN)同时进行预测。然后计算两个网络的检测损失和对比损失的联合损失用于训练。同时,引入了一种小损失选择机制,以减轻网络训练过程中错误标记样本的影响。随着联合训练的进展,这两个网络逐渐就ED任务达成一致。带有标签噪声的损坏数据是从基准数据集ACE2005中生成的。在不同水平的对称和不对称标签噪声下对ED任务进行了实验。实验结果表明,该模型对标签噪声的影响具有较强的鲁棒性,优于现有的电子任务模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信