Explicit Time Embedding Based Cascade Attention Network for Information Popularity Prediction

• URL: http://arxiv.org/abs/2308.09976v1
• Date: Sat, 19 Aug 2023 10:43:11 GMT
• Title: Explicit Time Embedding Based Cascade Attention Network for Information Popularity Prediction
• Authors: Xigang Sun, Jingya Zhou, Ling Liu, Wenqi Wei
• Abstract summary: We propose an explicit Time embedding based Cascade Attention Network (TCAN) as a novel popularity prediction architecture for large-scale information networks. TCAN integrates temporal attributes into node features via a general time embedding approach (TE), and then employs a cascade graph attention encoder (CGAT) and a cascade sequence attention encoder (CSAT) to fully learn the representation of cascade graphs and cascade sequences.
• Score: 12.645792211510276
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Predicting information cascade popularity is a fundamental problem in social networks. Capturing temporal attributes and cascade role information (e.g., cascade graphs and cascade sequences) is necessary for understanding the information cascade. Current methods rarely focus on unifying this information for popularity predictions, which prevents them from effectively modeling the full properties of cascades to achieve satisfactory prediction performances. In this paper, we propose an explicit Time embedding based Cascade Attention Network (TCAN) as a novel popularity prediction architecture for large-scale information networks. TCAN integrates temporal attributes (i.e., periodicity, linearity, and non-linear scaling) into node features via a general time embedding approach (TE), and then employs a cascade graph attention encoder (CGAT) and a cascade sequence attention encoder (CSAT) to fully learn the representation of cascade graphs and cascade sequences. We use two real-world datasets (i.e., Weibo and APS) with tens of thousands of cascade samples to validate our methods. Experimental results show that TCAN obtains mean logarithm squared errors of 2.007 and 1.201 and running times of 1.76 hours and 0.15 hours on both datasets, respectively. Furthermore, TCAN outperforms other representative baselines by 10.4%, 3.8%, and 10.4% in terms of MSLE, MAE, and R-squared on average while maintaining good interpretability.

Related papers

• On Your Mark, Get Set, Predict! Modeling Continuous-Time Dynamics of Cascades for Information Popularity Prediction [5.464598715181046]
  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.
  arXiv  Detail & Related papers  (2024-09-25T05:08:44Z)
• Hierarchical Information Enhancement Network for Cascade Prediction in Social Networks [51.54002032659713]
  We propose a novel Hierarchical Information Enhancement Network (HIENet) for cascade prediction. Our approach integrates fundamental cascade sequence, user social graphs, and sub-cascade graph into a unified framework.
  arXiv  Detail & Related papers  (2024-03-22T14:57:27Z)
• 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)
• Semi-Supervised and Long-Tailed Object Detection with CascadeMatch [91.86787064083012]
  We propose a novel pseudo-labeling-based detector called CascadeMatch. Our detector features a cascade network architecture, which has multi-stage detection heads with progressive confidence thresholds. We show that CascadeMatch surpasses existing state-of-the-art semi-supervised approaches in handling long-tailed object detection.
  arXiv  Detail & Related papers  (2023-05-24T07:09:25Z)
• Evidential Temporal-aware Graph-based Social Event Detection via Dempster-Shafer Theory [76.4580340399321]
  We propose ETGNN, a novel Evidential Temporal-aware Graph Neural Network. We construct view-specific graphs whose nodes are the texts and edges are determined by several types of shared elements respectively. Considering the view-specific uncertainty, the representations of all views are converted into mass functions through evidential deep learning (EDL) neural networks.
  arXiv  Detail & Related papers  (2022-05-24T16:22:40Z)
• Towards Similarity-Aware Time-Series Classification [51.2400839966489]
  We study time-series classification (TSC), a fundamental task of time-series data mining. We propose Similarity-Aware Time-Series Classification (SimTSC), a framework that models similarity information with graph neural networks (GNNs)
  arXiv  Detail & Related papers  (2022-01-05T02:14:57Z)
• Temporal Graph Network Embedding with Causal Anonymous Walks Representations [54.05212871508062]
  We propose a novel approach for dynamic network representation learning based on Temporal Graph Network. For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings. We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
  arXiv  Detail & Related papers  (2021-08-19T15:39:52Z)
• Incomplete Gamma Integrals for Deep Cascade Prediction using Content, Network, and Exogenous Signals [30.959353518914366]
  We observe two significant temporal signals in cascade data that have not been emphasized or reported to our knowledge. We propose GammaCas, a new cascade growth model as a parametric function of time. Specifically, our model processes these signals through a customized recurrent network, whose states then provide the parameters of the cascade rate function.
  arXiv  Detail & Related papers  (2021-06-13T14:44:36Z)
• Spatio-Temporal Inception Graph Convolutional Networks for Skeleton-Based Action Recognition [126.51241919472356]
  We design a simple and highly modularized graph convolutional network architecture for skeleton-based action recognition. Our network is constructed by repeating a building block that aggregates multi-granularity information from both the spatial and temporal paths.
  arXiv  Detail & Related papers  (2020-11-26T14:43:04Z)
• Cascade-LSTM: Predicting Information Cascades using Deep Neural Networks [0.0]
  We use Long-Short Term Memory (LSTM) neural network techniques to predict two-temporal properties of information cascades. Our approach leads to a classification accuracy of over 73% for information transmitters and 83% for early transmitters in a variety of social platforms.
  arXiv  Detail & Related papers  (2020-04-26T13:17:24Z)

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.