GTN-ED: Event Detection Using Graph Transformer Networks

• URL: http://arxiv.org/abs/2104.15104v1
• Date: Fri, 30 Apr 2021 16:35:29 GMT
• Title: GTN-ED: Event Detection Using Graph Transformer Networks
• Authors: Sanghamitra Dutta and Liang Ma and Tanay Kumar Saha and Di Lu and Joel Joel Tetreault and Alex Jaimes
• Abstract summary: We propose a novel framework for incorporating both dependencies and their labels using a recently proposed technique called Graph Transformer Networks (GTN) We integrate GTNs to leverage dependency relations on two existing homogeneous-graph-based models, and demonstrate an improvement in the F1 score on the ACE dataset.
• Score: 12.96137943176861
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent works show that the graph structure of sentences, generated from dependency parsers, has potential for improving event detection. However, they often only leverage the edges (dependencies) between words, and discard the dependency labels (e.g., nominal-subject), treating the underlying graph edges as homogeneous. In this work, we propose a novel framework for incorporating both dependencies and their labels using a recently proposed technique called Graph Transformer Networks (GTN). We integrate GTNs to leverage dependency relations on two existing homogeneous-graph-based models, and demonstrate an improvement in the F1 score on the ACE dataset.

Related papers

• A Pure Transformer Pretraining Framework on Text-attributed Graphs [50.833130854272774]
  We introduce a feature-centric pretraining perspective by treating graph structure as a prior. Our framework, Graph Sequence Pretraining with Transformer (GSPT), samples node contexts through random walks. GSPT can be easily adapted to both node classification and link prediction, demonstrating promising empirical success on various datasets.
  arXiv  Detail & Related papers  (2024-06-19T22:30:08Z)
• Pairwise Alignment Improves Graph Domain Adaptation [16.626928606474173]
  This work delves into Graph Domain Adaptation (GDA) to address the unique complexities of distribution shifts over graph data. We propose a novel, theoretically principled method, Pairwise Alignment (Pair-Align) to counter graph structure shift. Our method demonstrates superior performance in real-world applications, including node classification with region shift in social networks.
  arXiv  Detail & Related papers  (2024-03-02T04:31:28Z)
• BOURNE: Bootstrapped Self-supervised Learning Framework for Unified Graph Anomaly Detection [50.26074811655596]
  We propose a novel unified graph anomaly detection framework based on bootstrapped self-supervised learning (named BOURNE) By swapping the context embeddings between nodes and edges, we enable the mutual detection of node and edge anomalies. BOURNE can eliminate the need for negative sampling, thereby enhancing its efficiency in handling large graphs.
  arXiv  Detail & Related papers  (2023-07-28T00:44:57Z)
• TGNN: A Joint Semi-supervised Framework for Graph-level Classification [34.300070497510276]
  We propose a novel semi-supervised framework called Twin Graph Neural Network (TGNN) To explore graph structural information from complementary views, our TGNN has a message passing module and a graph kernel module. We evaluate our TGNN on various public datasets and show that it achieves strong performance.
  arXiv  Detail & Related papers  (2023-04-23T15:42:11Z)
• Graph Transformer GANs for Graph-Constrained House Generation [223.739067413952]
  We present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations. The GTGAN learns effective graph node relations in an end-to-end fashion for the challenging graph-constrained house generation task.
  arXiv  Detail & Related papers  (2023-03-14T20:35:45Z)
• Entailment Graph Learning with Textual Entailment and Soft Transitivity [69.91691115264132]
  We propose a two-stage method, Entailment Graph with Textual Entailment and Transitivity (EGT2) EGT2 learns local entailment relations by recognizing possible textual entailment between template sentences formed by CCG-parsed predicates. Based on the generated local graph, EGT2 then uses three novel soft transitivity constraints to consider the logical transitivity in entailment structures.
  arXiv  Detail & Related papers  (2022-04-07T08:33:06Z)
• GraphDCA -- a Framework for Node Distribution Comparison in Real and Synthetic Graphs [72.51835626235368]
  We argue that when comparing two graphs, the distribution of node structural features is more informative than global graph statistics. We present GraphDCA - a framework for evaluating similarity between graphs based on the alignment of their respective node representation sets.
  arXiv  Detail & Related papers  (2022-02-08T14:19:19Z)
• Syntax-Aware Graph-to-Graph Transformer for Semantic Role Labelling [18.028902306143102]
  We propose a Syntax-aware Graph-to-Graph Transformer (SynG2G-Tr) model, which encodes the syntactic structure using a novel way to input graph relations as embeddings. This approach adds a soft bias towards attention patterns that follow the syntactic structure but also allows the model to use this information to learn alternative patterns. We evaluate our model on both span-based and dependency-based SRL datasets, and outperform previous alternative methods in both in-domain and out-of-domain settings.
  arXiv  Detail & Related papers  (2021-04-15T18:14:18Z)
• Factorizable Graph Convolutional Networks [90.59836684458905]
  We introduce a novel graph convolutional network (GCN) that explicitly disentangles intertwined relations encoded in a graph. FactorGCN takes a simple graph as input, and disentangles it into several factorized graphs. We evaluate the proposed FactorGCN both qualitatively and quantitatively on the synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2020-10-12T03:01:40Z)
• Contextualised Graph Attention for Improved Relation Extraction [18.435408046826048]
  A novel method is proposed to use multiple sub-graphs to learn rich node representations in graph-based networks. Two types of edge features are proposed, which are effectively combined with GAT and GCN models to apply for relation extraction. The proposed model achieves state-of-the-art performance on Semeval 2010 Task 8 dataset, achieving an F1-score of 86.3.
  arXiv  Detail & Related papers  (2020-04-22T15:04:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.