MOHGCAA, a multi-order hyperbolic graph convolution with aggregated attention, is reported to outperform prior Euclidean and hyperbolic baselines on four datasets in supervised and unsupervised settings.
Edge-Enhanced Graph Convolution Networks for Event Detection with Syntactic Relation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Event detection (ED), a key subtask of information extraction, aims to recognize instances of specific event types in text. Previous studies on the task have verified the effectiveness of integrating syntactic dependency into graph convolutional networks. However, these methods usually ignore dependency label information, which conveys rich and useful linguistic knowledge for ED. In this paper, we propose a novel architecture named Edge-Enhanced Graph Convolution Networks (EE-GCN), which simultaneously exploits syntactic structure and typed dependency label information to perform ED. Specifically, an edge-aware node update module is designed to generate expressive word representations by aggregating syntactically-connected words through specific dependency types. Furthermore, to fully explore clues hidden in dependency edges, a node-aware edge update module is introduced, which refines the relation representations with contextual information. These two modules are complementary to each other and work in a mutual promotion way. We conduct experiments on the widely used ACE2005 dataset and the results show significant improvement over competitive baseline methods.
citation-role summary
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Multi-Order Hyperbolic Graph Convolution and Aggregated Attention for Social Event Detection
MOHGCAA, a multi-order hyperbolic graph convolution with aggregated attention, is reported to outperform prior Euclidean and hyperbolic baselines on four datasets in supervised and unsupervised settings.