On Your Mark, Get Set, Predict! Modeling Continuous-Time Dynamics of Cascades for Information Popularity Prediction

• URL: http://arxiv.org/abs/2409.16623v1
• Date: Wed, 25 Sep 2024 05:08:44 GMT
• Title: On Your Mark, Get Set, Predict! Modeling Continuous-Time Dynamics of Cascades for Information Popularity Prediction
• Authors: Xin Jing, Yichen Jing, Yuhuan Lu, Bangchao Deng, Sikun Yang, Dingqi Yang,
• Abstract summary: Key to accurately predicting information popularity lies in subtly modeling the underlying temporal information diffusion process. We propose ConCat, modeling the Continuous-time dynamics of Cascades for information popularity prediction. We conduct extensive experiments to evaluate ConCat on three real-world datasets.
• Score: 5.464598715181046
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Information popularity prediction is important yet challenging in various domains, including viral marketing and news recommendations. The key to accurately predicting information popularity lies in subtly modeling the underlying temporal information diffusion process behind observed events of an information cascade, such as the retweets of a tweet. To this end, most existing methods either adopt recurrent networks to capture the temporal dynamics from the first to the last observed event or develop a statistical model based on self-exciting point processes to make predictions. However, information diffusion is intrinsically a complex continuous-time process with irregularly observed discrete events, which is oversimplified using recurrent networks as they fail to capture the irregular time intervals between events, or using self-exciting point processes as they lack flexibility to capture the complex diffusion process. Against this background, we propose ConCat, modeling the Continuous-time dynamics of Cascades for information popularity prediction. On the one hand, it leverages neural Ordinary Differential Equations (ODEs) to model irregular events of a cascade in continuous time based on the cascade graph and sequential event information. On the other hand, it considers cascade events as neural temporal point processes (TPPs) parameterized by a conditional intensity function which can also benefit the popularity prediction task. We conduct extensive experiments to evaluate ConCat on three real-world datasets. Results show that ConCat achieves superior performance compared to state-of-the-art baselines, yielding a 2.3%-33.2% improvement over the best-performing baselines across the three datasets.

Related papers

• CasFT: Future Trend Modeling for Information Popularity Prediction with Dynamic Cues-Driven Diffusion Models [5.302417649818668]
  We propose CasFT, which leverages observed information neurals and dynamic cues extracted via ODEs to guide the generation of Future-increasing Trends. Experiments conducted on three real-world datasets demonstrate that CasFT improves the prediction accuracy, compared to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-09-25T05:03:16Z)
• HIP Network: Historical Information Passing Network for Extrapolation Reasoning on Temporal Knowledge Graph [14.832067253514213]
  We propose the Historical Information Passing (HIP) network to predict future events. Our method considers the updating of relation representations and adopts three scoring functions corresponding to the above dimensions. Experimental results on five benchmark datasets show the superiority of HIP network.
  arXiv  Detail & Related papers  (2024-02-19T11:50:30Z)
• TimeGraphs: Graph-based Temporal Reasoning [64.18083371645956]
  TimeGraphs is a novel approach that characterizes dynamic interactions as a hierarchical temporal graph. Our approach models the interactions using a compact graph-based representation, enabling adaptive reasoning across diverse time scales. We evaluate TimeGraphs on multiple datasets with complex, dynamic agent interactions, including a football simulator, the Resistance game, and the MOMA human activity dataset.
  arXiv  Detail & Related papers  (2024-01-06T06:26:49Z)
• Interacting Diffusion Processes for Event Sequence Forecasting [20.380620709345898]
  We introduce a novel approach that incorporates a diffusion generative model. The model facilitates sequence-to-sequence prediction, allowing multi-step predictions based on historical event sequences. We demonstrate that our proposal outperforms state-of-the-art baselines for long-horizon forecasting of TPP.
  arXiv  Detail & Related papers  (2023-10-26T22:17:25Z)
• HierCas: Hierarchical Temporal Graph Attention Networks for Popularity Prediction in Information Cascades [25.564185461383655]
  Information cascade popularity prediction is critical for many applications, including but not limited to identifying fake news and accurate recommendations. Traditional feature-based methods rely on handcrafted features, which are domain-specific and lack generalizability to new domains. We propose Hierarchical Temporal Graph Attention Networks for cascade popularity prediction (HierCas), which operates on the entire cascade graph by a dynamic graph modeling approach.
  arXiv  Detail & Related papers  (2023-10-20T01:55:10Z)
• Exploring the Limits of Historical Information for Temporal Knowledge Graph Extrapolation [59.417443739208146]
  We propose a new event forecasting model based on a novel training framework of historical contrastive learning. CENET learns both the historical and non-historical dependency to distinguish the most potential entities. We evaluate our proposed model on five benchmark graphs.
  arXiv  Detail & Related papers  (2023-08-29T03:26:38Z)
• Generative Time Series Forecasting with Diffusion, Denoise, and Disentanglement [51.55157852647306]
  Time series forecasting has been a widely explored task of great importance in many applications. It is common that real-world time series data are recorded in a short time period, which results in a big gap between the deep model and the limited and noisy time series. We propose to address the time series forecasting problem with generative modeling and propose a bidirectional variational auto-encoder equipped with diffusion, denoise, and disentanglement.
  arXiv  Detail & Related papers  (2023-01-08T12:20:46Z)
• 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)
• Variational Neural Temporal Point Process [22.396329275957996]
  A temporal point process is a process that predicts which type of events is likely to happen and when the event will occur. We introduce the inference and the generative networks, and train a distribution of latent variable to deal with property on deep neural network. We empirically demonstrate that our model can generalize the representations of various event types.
  arXiv  Detail & Related papers  (2022-02-17T13:34:30Z)
• Dynamic Hawkes Processes for Discovering Time-evolving Communities' States behind Diffusion Processes [57.22860407362061]
  We propose a novel Hawkes process model that is able to capture the underlying dynamics of community states behind the diffusion processes. The proposed method, termed DHP, offers a flexible way to learn complex representations of the time-evolving communities' states.
  arXiv  Detail & Related papers  (2021-05-24T08:35:48Z)
• A Multi-Channel Neural Graphical Event Model with Negative Evidence [76.51278722190607]
  Event datasets are sequences of events of various types occurring irregularly over the time-line. We propose a non-parametric deep neural network approach in order to estimate the underlying intensity functions.
  arXiv  Detail & Related papers  (2020-02-21T23:10: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.