Future is not One-dimensional: Graph Modeling based Complex Event Schema Induction for Event Prediction

• URL: http://arxiv.org/abs/2104.06344v2
• Date: Thu, 15 Apr 2021 17:14:37 GMT
• Title: Future is not One-dimensional: Graph Modeling based Complex Event Schema Induction for Event Prediction
• Authors: Manling Li, Sha Li, Zhenhailong Wang, Lifu Huang, Kyunghyun Cho, Heng Ji, Jiawei Han, Clare Voss
• Abstract summary: We introduce the concept of Temporal Complex Event: a graph-based schema representation that encompasses events, arguments, temporal connections and argument relations. We release a new schema learning corpus containing 6,399 documents accompanied with event graphs, and manually constructed gold schemas.
• Score: 90.75260063651763
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Event schemas encode knowledge of stereotypical structures of events and their connections. As events unfold, schemas are crucial to act as a scaffolding. Previous work on event schema induction either focuses on atomic events or linear temporal event sequences, ignoring the interplay between events via arguments and argument relations. We introduce the concept of Temporal Complex Event Schema: a graph-based schema representation that encompasses events, arguments, temporal connections and argument relations. Additionally, we propose a Temporal Event Graph Model that models the emergence of event instances following the temporal complex event schema. To build and evaluate such schemas, we release a new schema learning corpus containing 6,399 documents accompanied with event graphs, and manually constructed gold schemas. Intrinsic evaluation by schema matching and instance graph perplexity, prove the superior quality of our probabilistic graph schema library compared to linear representations. Extrinsic evaluation on schema-guided event prediction further demonstrates the predictive power of our event graph model, significantly surpassing human schemas and baselines by more than 17.8% on HITS@1.

Related papers

• Prompt-based Graph Model for Joint Liberal Event Extraction and Event Schema Induction [1.3154296174423619]
  Events are essential components of speech and texts, describing the changes in the state of entities. The event extraction task aims to identify and classify events and find their participants according to event schemas. The researchers propose Liberal Event Extraction (LEE), which aims to extract events and discover event schemas simultaneously.
  arXiv  Detail & Related papers  (2024-03-19T07:56:42Z)
• Open-Domain Hierarchical Event Schema Induction by Incremental Prompting and Verification [81.17473088621209]
  We treat event schemas as a form of commonsense knowledge that can be derived from large language models (LLMs) We design an incremental prompting and verification method to break down the construction of a complex event graph into three stages. Compared to directly using LLMs to generate a linearized graph, our method can generate large and complex schemas with 7.2% F1 improvement in temporal relations and 31.0% F1 improvement in hierarchical relations.
  arXiv  Detail & Related papers  (2023-07-05T01:00:44Z)
• Drafting Event Schemas using Language Models [48.81285141287434]
  We look at the process of creating such schemas to describe complex events. Our focus is on whether we can achieve sufficient diversity and recall of key events. We show that large language models are able to achieve moderate recall against schemas taken from two different datasets.
  arXiv  Detail & Related papers  (2023-05-24T07:57:04Z)
• Zero-Shot On-the-Fly Event Schema Induction [61.91468909200566]
  We present a new approach in which large language models are utilized to generate source documents that allow predicting, given a high-level event definition, the specific events, arguments, and relations between them. Using our model, complete schemas on any topic can be generated on-the-fly without any manual data collection, i.e., in a zero-shot manner.
  arXiv  Detail & Related papers  (2022-10-12T14:37:00Z)
• Schema-Guided Event Graph Completion [103.32326979796596]
  We tackle a new task, event graph completion, which aims to predict missing event nodes for event graphs. Existing prediction or graph completion methods have difficulty dealing with event graphs because they are usually designed for a single large graph.
  arXiv  Detail & Related papers  (2022-06-06T21:51:10Z)
• A Graph Enhanced BERT Model for Event Prediction [35.02248467245135]
  We consider automatically building of event graph using a BERT model. We incorporate an additional structured variable into BERT to learn to predict the event connections in the training process. Results on two event prediction tasks: script event prediction and story ending prediction, show that our approach can outperform state-of-the-art baseline methods.
  arXiv  Detail & Related papers  (2022-05-22T13:37:38Z)
• CEP3: Community Event Prediction with Neural Point Process on Graph [59.434777403325604]
  We propose a novel model combining Graph Neural Networks and Marked Temporal Point Process (MTPP) Our experiments demonstrate the superior performance of our model in terms of both model accuracy and training efficiency.
  arXiv  Detail & Related papers  (2022-05-21T15:30:25Z)

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.