A Graph Regularized Point Process Model For Event Propagation Sequence

• URL: http://arxiv.org/abs/2211.11758v1
• Date: Mon, 21 Nov 2022 04:49:59 GMT
• Title: A Graph Regularized Point Process Model For Event Propagation Sequence
• Authors: Siqiao Xue, Xiaoming Shi, Hongyan Hao, Lintao Ma, Shiyu Wang, Shijun Wang, James Zhang
• Abstract summary: Point process is the dominant paradigm for modeling event sequences occurring at irregular intervals. We propose a Graph Regularized Point Process that characterizes the event interactions across nodes with neighbors. By applying a graph regularization method, GRPP provides model interpretability by uncovering influence strengths between nodes.
• Score: 2.9093633827040724
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Point process is the dominant paradigm for modeling event sequences occurring at irregular intervals. In this paper we aim at modeling latent dynamics of event propagation in graph, where the event sequence propagates in a directed weighted graph whose nodes represent event marks (e.g., event types). Most existing works have only considered encoding sequential event history into event representation and ignored the information from the latent graph structure. Besides they also suffer from poor model explainability, i.e., failing to uncover causal influence across a wide variety of nodes. To address these problems, we propose a Graph Regularized Point Process (GRPP) that can be decomposed into: 1) a graph propagation model that characterizes the event interactions across nodes with neighbors and inductively learns node representations; 2) a temporal attentive intensity model, whose excitation and time decay factors of past events on the current event are constructed via the contextualization of the node embedding. Moreover, by applying a graph regularization method, GRPP provides model interpretability by uncovering influence strengths between nodes. Numerical experiments on various datasets show that GRPP outperforms existing models on both the propagation time and node prediction by notable margins.

Related papers

• IFH: a Diffusion Framework for Flexible Design of Graph Generative Models [53.219279193440734]
  Graph generative models can be classified into two prominent families: one-shot models, which generate a graph in one go, and sequential models, which generate a graph by successive additions of nodes and edges. This paper proposes a graph generative model, called Insert-Fill-Halt (IFH), that supports the specification of a sequentiality degree.
  arXiv  Detail & Related papers  (2024-08-23T16:24:40Z)
• Inference of Sequential Patterns for Neural Message Passing in Temporal Graphs [0.6562256987706128]
  HYPA-DBGNN is a novel two-step approach that combines the inference of anomalous sequential patterns in time series data on graphs. Our method leverages hypergeometric graph ensembles to identify anomalous edges within both first- and higher-order De Bruijn graphs. Our work is the first to introduce statistically informed GNNs that leverage temporal and causal sequence anomalies.
  arXiv  Detail & Related papers  (2024-06-24T11:41:12Z)
• Deep graph kernel point processes [17.74234892097879]
  This paper presents a novel point process model for discrete event data over graphs, where the event interaction occurs within a latent graph structure. The key idea is to represent the influence kernel by Graph Neural Networks (GNN) to capture the underlying graph structure. Compared with prior works focusing on directly modeling the conditional intensity function using neural networks, our kernel presentation herds the repeated event influence patterns more effectively.
  arXiv  Detail & Related papers  (2023-06-20T06:15:19Z)
• A Diffusion Model for Event Skeleton Generation [32.288113334600595]
  Event skeleton generation is a critical step in the temporal complex event schema induction task. Existing methods effectively address this task from a graph generation perspective. We propose a novel Diffusion Event Graph Model(DEGM) to address these issues.
  arXiv  Detail & Related papers  (2023-05-27T12:19:21Z)
• Dynamic Causal Explanation Based Diffusion-Variational Graph Neural Network for Spatio-temporal Forecasting [60.03169701753824]
  We propose a novel Dynamic Diffusion-al Graph Neural Network (DVGNN) fortemporal forecasting. The proposed DVGNN model outperforms state-of-the-art approaches and achieves outstanding Root Mean Squared Error result.
  arXiv  Detail & Related papers  (2023-05-16T11:38:19Z)
• Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation [67.26422477327179]
  Temporal graphs exhibit dynamic interactions between nodes over continuous time. We propose a novel method of temporal graph convolution with the whole neighborhood. Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
  arXiv  Detail & Related papers  (2023-04-15T08:17:18Z)
• 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)
• Event Detection on Dynamic Graphs [4.128347119808724]
  Event detection is a critical task for timely decision-making in graph analytics applications. We propose DyGED, a simple yet novel deep learning model for event detection on dynamic graphs.
  arXiv  Detail & Related papers  (2021-10-23T05:52:03Z)
• Future is not One-dimensional: Graph Modeling based Complex Event Schema Induction for Event Prediction [90.75260063651763]
  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.
  arXiv  Detail & Related papers  (2021-04-13T16:41:05Z)
• CatGCN: Graph Convolutional Networks with Categorical Node Features [99.555850712725]
  CatGCN is tailored for graph learning when the node features are categorical. We train CatGCN in an end-to-end fashion and demonstrate it on semi-supervised node classification.
  arXiv  Detail & Related papers  (2020-09-11T09:25:17Z)
• Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs [38.56057203198837]
  Hawkes process has become a standard method for modeling self-exciting event sequences with different event types. We propose the Graph Hawkes Neural Network that can capture the dynamics of evolving graph sequences and can predict the occurrence of a fact in a future time instance.
  arXiv  Detail & Related papers  (2020-03-30T12:56:50Z)

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.