mlsanityData to 14 Oct 2026

Who Would be Interested in Services? An Entity Graph Learning System for User Targeting

arXiv 2305.18780 ↗First posted 30 May 2023cs.LG cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

With the growing popularity of various mobile devices, user targeting has received a growing amount of attention, which aims at effectively and efficiently locating target users that are interested in specific services. Most pioneering works for user targeting tasks commonly perform similarity-based expansion with a few active users as seeds, suffering from the following major issues: the unavailability of seed users for newcoming services and the unfriendliness of black-box procedures towards marketers. In this paper, we design an Entity Graph Learning (EGL) system to provide explainable user targeting ability meanwhile applicable to addressing the cold-start issue. EGL System follows the hybrid online-offline architecture to satisfy the requirements of scalability and timeliness. Specifically, in the offline stage, the system focuses on the heavyweight entity graph construction and user entity preference learning, in which we propose a Three-stage Relation Mining Procedure (TRMP), breaking loose from the expensive seed users. At the online stage, the system offers the ability of user targeting in real-time based on the entity graph from the offline stage. Since the user targeting process is based on graph reasoning, the whole process is transparent and operation-friendly to marketers. Finally, extensive offline experiments and online A/B testing demonstrate the superior performance of the proposed EGL System.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 27 of its 46 references that are in the map. First posted on arXiv 30 May 2023.

Builds on

27 of 46 references.

References · 27

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2017Graph Attention Networkscited by 8,923
  4. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  5. 2017Inductive Representation Learning on Large Graphscited by 6,320
  6. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  7. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
  8. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  9. 2014DeepWalk: Online Learning of Social Representationscited by 1,547
  10. 2016Variational Graph Auto-Encoderscited by 1,382
  11. 2018Link Prediction Based on Graph Neural Networkscited by 832
  12. 2015LINE: Large-scale Information Network Embeddingcited by 582
15 more
  1. 2020A Survey on Contrastive Self-supervised Learningcited by 554
  2. 2019Composition-based Multi-Relational Graph Convolutional Networkscited by 396
  3. 2020Keystroke Dynamics as Part of Lifeloggingcited by 334
  4. 2018A Survey on Deep Learning for Named Entity Recognitioncited by 282
  5. 2019Hyperbolic Graph Neural Networkscited by 244
  6. 2019Inductive Relation Prediction by Subgraph Reasoningcited by 239
  7. 2022Discovering Invariant Rationales for Graph Neural Networkscited by 188
  8. 2021Deep Stable Learning for Out-Of-Distribution Generalizationcited by 153
  9. 2017Heterogeneous Information Network Embedding for Recommendationcited by 133
  10. 2020Heterogeneous Graph Neural Networks for Malicious Account Detectioncited by 96
  11. 2018Chinese NER Using Lattice LSTMcited by 81
  12. 2019Portuguese Named Entity Recognition using BERT-CRFcited by 73
  13. 2019Stable Learning via Sample Reweightingcited by 70
  14. 2018GeniePath: Graph Neural Networks with Adaptive Receptive Pathscited by 66
  15. 2021Learning to Expand Audience via Meta Hybrid Experts and Critics for Recommendation and Advertisingcited by 11

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 1.

3 papers.