Semantics-enhanced Temporal Graph Networks for Content Popularity Prediction
Not on the map. Why?
Abstract (arXiv)
The surging demand for high-definition video streaming services and large neural network models (e.g., Generative Pre-trained Transformer, GPT) implies a tremendous explosion of Internet traffic. To mitigate the traffic pressure, architectures with in-network storage have been proposed to cache popular contents at devices in closer proximity to users. Correspondingly, in order to maximize caching utilization, it becomes essential to devise an effective popularity prediction method. In that regard, predicting popularity with dynamic graph neural network (DGNN) models achieve remarkable performance. However, DGNN models still suffer from tackling sparse datasets where most users are inactive. Therefore, we propose a reformative temporal graph network, named semantics-enhanced temporal graph network (STGN), which attaches extra semantic information into the user-content bipartite graph and could better leverage implicit relationships behind the superficial topology structure. On top of that, we customize its temporal and structural learning modules to further boost the prediction performance. Specifically, in order to efficiently aggregate the diversified semantics that a content might possess, we design a user-specific attention (UsAttn) mechanism for temporal learning module. Unlike the attention mechanism that only analyzes the influence of genres on content, UsAttn also considers the attraction of semantic information to a specific user. Meanwhile, as for the structural learning, we introduce the concept of positional encoding into our attention-based graph learning and adopt a semantic positional encoding (SPE) function to facilitate the analysis of content-oriented user-association analysis. Finally, extensive simulations verify the superiority of our STGN models and demonstrate the effectiveness in content caching.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 54 references that are in the map. First posted on arXiv 29 Jan 2023.
Builds on
23 of 54 references.
References · 23
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2017Graph Attention Networkscited by 8,854
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
- 2020Reformer: The Efficient Transformercited by 1,658
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
- 2018Image Transformercited by 770
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
- 2020Pre-trained Models for Natural Language Processing: A Surveycited by 504
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
- 2020Inductive Representation Learning on Temporal Graphscited by 454
- 2018RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systemscited by 136
11 more
- 2020Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A surveycited by 123
- 2020Communication-Efficient Edge AI: Algorithms and Systemscited by 95
- 2021Learnable Fourier Features for Multi-Dimensional Spatial Positional Encodingcited by 93
- 2018Improving Question Answering by Commonsense-Based Pre-Trainingcited by 66
- 2022Wireless Deep Video Semantic Transmissioncited by 49
- 2019Mobile Edge Intelligence and Computing for the Internet of Vehiclescited by 22
- 2020Contextualized Graph Attention Network for Recommendation with Item Knowledge Graphcited by 10
- 2021TEDGE-Caching: Transformer-based Edge Caching Towards 6G Networkscited by 7
- 2020Deep Learning for Wireless Coded Caching with Unknown and Time-Variant Content Popularitycited by 6
- 2021Cocktail Edge Caching: Ride Dynamic Trends of Content Popularity with Ensemble Learningcited by 5
- 2022AoI-based Temporal Attention Graph Neural Network for Popularity Prediction and Content Cachingcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.