Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Modeling Event Propagation via Graph Biased Temporal Point Process (1908.01623v2)

Published 5 Aug 2019 in cs.SI and cs.LG

Abstract: Temporal point process is widely used for sequential data modeling. In this paper, we focus on the problem of modeling sequential event propagation in graph, such as retweeting by social network users, news transmitting between websites, etc. Given a collection of event propagation sequences, conventional point process model consider only the event history, i.e. embed event history into a vector, not the latent graph structure. We propose a Graph Biased Temporal Point Process (GBTPP) leveraging the structural information from graph representation learning, where the direct influence between nodes and indirect influence from event history is modeled respectively. Moreover, the learned node embedding vector is also integrated into the embedded event history as side information. Experiments on a synthetic dataset and two real-world datasets show the efficacy of our model compared to conventional methods and state-of-the-art.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Weichang Wu (6 papers)
  2. Huanxi Liu (2 papers)
  3. Xiaohu Zhang (37 papers)
  4. Yu Liu (786 papers)
  5. Hongyuan Zha (136 papers)
Citations (34)

Summary

We haven't generated a summary for this paper yet.