arrow
Return

Graph Convolution Over Multiple Latent Context-Aware Graph Structures for Event Detection

delete2020-01-01
delete14
delete
OA
AI
L
Lei Li
L
Li Jin *
Z
Zequn Zhang
Q
Qing Liu
X
Xian Sun
H
Hongqi Wang
DOI:10.1109/ACCESS.2020.3024872delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Event detection is a particularly challenging problem in information extraction. The current neural network models have proved that dependency tree can better capture the correlation between candidate trigger words and related context in the sentence. However, syntactic information conveyed by the original dependency tree is insufficient for detecting trigger since the dependency tree obtained from natural language processing toolkits ignores semantic context information. Existing approaches employ a static graph structure based on original dependency tree which is incompetent in terms of distinguishing interrelations among trigger words and contextual words. So how to effectively make use of relevant information while ignoring irrelevant information from the dependency trees remains a challenging research question. To address this problem, we investigate a graph convolutional network over multiple latent context-aware graph structures to perform event detection. We exploit a multi-head attention mechanism on BERT representation and original adjacency matrix to generate multiple latent context-aware graph structures (a dynamic cutting strategy), which can automatically learn how to select the useful dependency information. Furthermore, we investigate graph convolutional networks with residual connections to combine the local and non-local contextual information. Experimental results on ACE2005 dataset show that our model achieves competitive performances compared with the methods based on dependency tree for event detection.
Keywords:
Event detection
Syntactics
Bit error rate
Task analysis
Feature extraction
Convolution
Semantics
Event detection
graph convolutional network
multi-head attention
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

C
chinese academy of sciences
Scholars:
56.7W
Papers: 45.0W
Citations: 704
Cited Papers

Cited Papers

Relative Sea‐Level Changes During Roman Times in the Northwest Mediterranean: The 1st Century A.D. Fish Tank of Forum Julii, Fréjus, France
err2013-05-21
err0
PREAI
errChristophe Morhange; Nick Marriner; Pierre Excoffon; Stéphane Bonnet; Clément Flaux; Helmut Zibrowius; Jean‐Philippe Goiran; Mourad El Amouri
errShare
errSave
Epidemiology and diagnostic and therapeutic management of febrile seizures in the Italian pediatric emergency departments: A prospective observational study
err2017-01-01
err0
PREAI
errGiovanna Vitaliti; Emanuele Castagno; Fulvio Ricceri; Antonio Urbino; Alberto Verrotti Di Pianella; Riccardo Lubrano; Elisa Caramaschi; Maurizio Prota; Rita Maria Pulvirenti; Patrizia Ajovalasit; Giuseppe Signorile; Carla Navone; Maria Rosaria La Bianca; Alberto Villani; Giovanni Corsello; Raffaele Falsaperla
errShare
errSave
Aluminum-induced degeneration of astrocytes occurs via apoptosis and results in neuronal death
err1999-07-01
err0
PREAI
errM.Belen Suárez-Fernández; Ana B. Soldado; Alfredo Sanz-Medel; Jose-Antonio Vega; Antonello Novelli; M.Teresa Fernández-Sánchez
errShare
errSave
Analyzing of Molecular Networks for Human Diseases and Drug Discovery
err2018-09-18
err0
errOAAI
errTong Hao; Qian Wang; Lingxuan Zhao; Dan Wu; Edwin Wang; Jinsheng Sun
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
On the path homology theory of digraphs and Eilenberg–Steenrod axioms
err2018-01-01
err0
errOAAI
errAlexander Grigor’yan; Rolando Jimenez; Yuri Muranov; Shing-Tung Yau
errShare
errSave
researcher View more