Deep Semantic-Enhanced Event Detection via Symmetric Graph Convolutional Network

被引:0
作者
Sun, Chenchen [1 ,2 ]
Zhuo, Xingrui [1 ,2 ]
Lu, Zhenya [1 ,2 ]
Bu, Chenyang [1 ,2 ]
Wu, Gongqing [1 ,2 ]
机构
[1] Hefei Univ Technol, Minist Educ China, Key Lab Knowledge Engn Big Data, Hefei, Peoples R China
[2] Hefei Univ Technol, Sch Comp Sci & Informat Engn, Hefei, Peoples R China
来源
2022 IEEE INTERNATIONAL CONFERENCE ON KNOWLEDGE GRAPH (ICKG) | 2022年
基金
中国国家自然科学基金;
关键词
event detection; graph convolutional network; attention gating mechanism; graph perturbation mechanism; syntactic information;
D O I
10.1109/ICKG55886.2022.00038
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Event detection, an important research topic of information extraction, aims to automatically identify and classify event instances from the text. Previous studies have introduced methods combining syntactic information and graph convolutional networks into the field of event detection and verified their effectiveness. However, such methods often ignore the high-order information on the syntactic tree with noisy words, which limits their classification quality. In this paper, we propose a deep symmetric graph convolutional network to organically integrate high-order and low-order syntactic information to strengthen the semantic features of sentences. Specifically, we design a skip connection with attention gating mechanism, which selects valuable low-order syntactic information under the supervision of high-order syntactic information to strengthen the aggregation of high-order and low-order syntactic information. Then, a graph perturbation mechanism is proposed to discard noisy nodes on the syntactic graph to reduce the noisy information in the high-order syntactic information. We conducted extensive experiments on the widely used ACE 2005 benchmark, and the experimental results demonstrate that our method significantly outperforms state-of-the-art methods. Then, a graph perturbation mechanism is proposed to discard noisy nodes on the syntactic graph to reduce the noisy information in the high-order syntactic information. We conducted extensive experiments on the widely used ACE 2005 benchmark, and the experimental results demonstrate that our method significantly outperforms state-of-the-art methods. We conducted extensive experiments on the widely used ACE 2005 benchmark, and the experimental results demonstrate that our method significantly outperforms state-of-the-art methods. Then, a graph perturbation mechanism is proposed to discard noisy nodes on the syntactic graph to reduce the noisy information in the high-order syntactic information.
引用
收藏
页码:241 / 248
页数:8
相关论文
共 45 条
  • [1] Joint event extraction along shortest dependency paths using graph convolutional networks
    Balali, Ali
    Asadpour, Masoud
    Campos, Ricardo
    Jatowt, Adam
    [J]. KNOWLEDGE-BASED SYSTEMS, 2020, 210 (210)
  • [2] Semi-automatic financial events discovery based on lexico-semantic patterns
    Borsje J.
    Hogenboom F.
    Frasincar F.
    [J]. International Journal of Web Engineering and Technology, 2010, 6 (02) : 115 - 140
  • [3] Chen P, 2020, 1ST CONFERENCE OF THE ASIA-PACIFIC CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 10TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING (AACL-IJCNLP 2020), P811
  • [4] Chen YB, 2015, PROCEEDINGS OF THE 53RD ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 7TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1, P167
  • [5] Cui S., 2020, P 2020 C EMP METH NA, P2329
  • [6] Du Xinya, 2020, P 58 ANN M ASS COMP, P8010, DOI DOI 10.18653/V1/2020.ACL-MAIN.714
  • [7] Gao HY, 2019, PR MACH LEARN RES, V97
  • [8] Chinese causal event extraction using causality-associated graph neural network
    Gao, Jianqi
    Luo, Xiangfeng
    Wang, Hao
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (03)
  • [9] Graves A, 2012, STUD COMPUT INTELL, V385, P1, DOI [10.1007/978-3-642-24797-2, 10.1162/neco.1997.9.1.1]
  • [10] Hong Y., 2011, P 49 ANN M ASS COMP, P1127