Physics-Informed Neural Network with Adaptive Clustering Learning Mechanism for Information Popularity Prediction

• URL: http://arxiv.org/abs/2603.19599v1
• Date: Fri, 20 Mar 2026 03:16:07 GMT
• Title: Physics-Informed Neural Network with Adaptive Clustering Learning Mechanism for Information Popularity Prediction
• Abstract summary: We propose a physics-informed neural network with adaptive clustering learning mechanism, PIACN, for predicting the popularity of information cascades.<n>Our proposed model not only models the macroscopic patterns of information dissemination through physics-informed approach for the first time.<n>Our model significantly outperforms other state-of-the-art methods in predicting information popularity.
• Score: 54.483041939268766
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: With society entering the Internet era, the volume and speed of data and information have been increasing. Predicting the popularity of information cascades can help with high-value information delivery and public opinion monitoring on the internet platforms. The current state-of-the-art models for predicting information popularity utilize deep learning methods such as graph convolution networks (GCNs) and recurrent neural networks (RNNs) to capture early cascades and temporal features to predict their popularity increments. However, these previous methods mainly focus on the micro features of information cascades, neglecting their general macroscopic patterns. Furthermore, they also lack consideration of the impact of information heterogeneity on spread popularity. To overcome these limitations, we propose a physics-informed neural network with adaptive clustering learning mechanism, PIACN, for predicting the popularity of information cascades. Our proposed model not only models the macroscopic patterns of information dissemination through physics-informed approach for the first time but also considers the influence of information heterogeneity through an adaptive clustering learning mechanism. Extensive experimental results on three real-world datasets demonstrate that our model significantly outperforms other state-of-the-art methods in predicting information popularity.

Related papers

• Epidemiology-informed Network for Robust Rumor Detection [59.89351792706995]
  We propose a novel Epidemiology-informed Network (EIN) that integrates epidemiological knowledge to enhance performance.<n>To adapt epidemiology theory to rumor detection, it is expected that each users stance toward the source information will be annotated.<n>Our experimental results demonstrate that the proposed EIN not only outperforms state-of-the-art methods on real-world datasets but also exhibits enhanced robustness across varying tree depths.
  arXiv  Detail & Related papers  (2024-11-20T00:43:32Z)
• Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective [64.04617968947697]
  We introduce a novel data-model co-design perspective: to promote superior weight sparsity. Specifically, customized Visual Prompts are mounted to upgrade neural Network sparsification in our proposed VPNs framework.
  arXiv  Detail & Related papers  (2023-12-03T13:50:24Z)
• Deep networks for system identification: a Survey [56.34005280792013]
  System identification learns mathematical descriptions of dynamic systems from input-output data. Main aim of the identified model is to predict new data from previous observations. We discuss architectures commonly adopted in the literature, like feedforward, convolutional, and recurrent networks.
  arXiv  Detail & Related papers  (2023-01-30T12:38:31Z)
• AoI-based Temporal Attention Graph Neural Network for Popularity Prediction and Content Caching [9.16219929722585]
  Information-centric network (ICN) aims to proactively keep limited popular content at the edge of network based on predicted results. In this paper, we leverage an effective dynamic graph neural network (DGNN) to jointly learn the structural and temporal patterns embedded in the bipartite graph. We also propose an age of information (AoI) based attention mechanism to extract valuable historical information.
  arXiv  Detail & Related papers  (2022-08-18T02:57:17Z)
• Preference Enhanced Social Influence Modeling for Network-Aware Cascade Prediction [59.221668173521884]
  We propose a novel framework to promote cascade size prediction by enhancing the user preference modeling. Our end-to-end method makes the user activating process of information diffusion more adaptive and accurate.
  arXiv  Detail & Related papers  (2022-04-18T09:25:06Z)
• Graph Representation Learning for Popularity Prediction Problem: A Survey [4.795530213347874]
  We present a comprehensive review for existing works using graph representation learning (GRL) methods for popularity prediction problem. Deep learning method is further classified into six small classes: convolutional neural networks, graph convolutional networks, graph attention networks, graph neural networks, recurrent neural networks, and reinforcement learning.
  arXiv  Detail & Related papers  (2022-03-15T04:11:46Z)
• EINNs: Epidemiologically-Informed Neural Networks [75.34199997857341]
  We introduce a new class of physics-informed neural networks-EINN-crafted for epidemic forecasting. We investigate how to leverage both the theoretical flexibility provided by mechanistic models as well as the data-driven expressability afforded by AI models.
  arXiv  Detail & Related papers  (2022-02-21T18:59:03Z)
• A Critical Review of Information Bottleneck Theory and its Applications to Deep Learning [0.0]
  Deep neural networks have seen unparalleled improvements that continue to impact every aspect of today's society. The information bottleneck theory has emerged as a promising approach to better understand the learning dynamics of neural networks. The goal of this survey is to provide a comprehensive review of IB theory covering it's information theoretic roots and the recently proposed applications to understand deep learning models.
  arXiv  Detail & Related papers  (2021-05-07T14:16:38Z)
• Prediction-Centric Learning of Independent Cascade Dynamics from Partial Observations [13.680949377743392]
  We address the problem of learning of a spreading model such that the predictions generated from this model are accurate. We introduce a computationally efficient algorithm, based on a scalable dynamic message-passing approach. We show that tractable inference from the learned model generates a better prediction of marginal probabilities compared to the original model.
  arXiv  Detail & Related papers  (2020-07-13T17:58:21Z)

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.