mlsanityData to 7 Oct 2026

Neighbour Interaction based Click-Through Rate Prediction via Graph-masked Transformer

arXiv 2201.13311 ↗First posted 25 Jan 2022cs.IR cs.AI cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Click-Through Rate (CTR) prediction, which aims to estimate the probability that a user will click an item, is an essential component of online advertising. Existing methods mainly attempt to mine user interests from users' historical behaviours, which contain users' directly interacted items. Although these methods have made great progress, they are often limited by the recommender system's direct exposure and inactive interactions, and thus fail to mine all potential user interests. To tackle these problems, we propose Neighbor-Interaction based CTR prediction (NI-CTR), which considers this task under a Heterogeneous Information Network (HIN) setting. In short, Neighbor-Interaction based CTR prediction involves the local neighborhood of the target user-item pair in the HIN to predict their linkage. In order to guide the representation learning of the local neighbourhood, we further consider different kinds of interactions among the local neighborhood nodes from both explicit and implicit perspective, and propose a novel Graph-Masked Transformer (GMT) to effectively incorporates these kinds of interactions to produce highly representative embeddings for the target user-item pair. Moreover, in order to improve model robustness against neighbour sampling, we enforce a consistency regularization loss over the neighbourhood embedding. We conduct extensive experiments on two real-world datasets with millions of instances and the experimental results show that our proposed method outperforms state-of-the-art CTR models significantly. Meanwhile, the comprehensive ablation studies verify the effectiveness of every component of our model. Furthermore, we have deployed this framework on the WeChat Official Account Platform with billions of users. The online A/B tests demonstrate an average CTR improvement of 21.9 against all online baselines.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 32 of its 40 references that are in the map. First posted on arXiv 25 Jan 2022.

Builds on

32 of 40 references.

References · 32

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Graph Attention Networkscited by 8,854
  5. 2017Inductive Representation Learning on Large Graphscited by 6,284
  6. 2016Layer Normalizationcited by 5,579
  7. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
  8. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  9. 2016Wide & Deep Learning for Recommender Systemscited by 745
  10. 2019Heterogeneous Graph Attention Networkcited by 732
  11. 2019Graph Neural Networks for Social Recommendationcited by 711
  12. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
20 more
  1. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
  2. 2020A Generalization of Transformer Networks to Graphscited by 653
  3. 2020Heterogeneous Graph Transformercited by 581
  4. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  5. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  6. 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 342
  7. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  8. 2021Do Transformers Really Perform Bad for Graph Representation?cited by 318
  9. 2016Bidirectional Attention Flow for Machine Comprehensioncited by 278
  10. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
  11. 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
  12. 2018Adaptive Sampling Towards Fast Graph Representation Learningcited by 180
  13. 2020Graph-Bert: Only Attention is Needed for Learning Graph Representationscited by 176
  14. 2017Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networkscited by 126
  15. 2019Deep Session Interest Network for Click-Through Rate Predictioncited by 64
  16. 2019Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systemscited by 41
  17. 2019SDM: Sequential Deep Matching Model for Online Large-scale Recommender Systemcited by 30
  18. 2020An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graphcited by 29
  19. 2019Representation Learning-Assisted Click-Through Rate Predictioncited by 9
  20. 2019An End-to-End Neighborhood-based Interaction Model for Knowledge-enhanced Recommendationcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 6; 2025: 3; 2026: 1.

13 papers.

Sort: