DisenCTR: Dynamic Graph-based Disentangled Representation for Click-Through Rate Prediction

25Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Click-through rate (CTR) prediction plays a critical role in recommender systems and other applications. Recently, modeling user behavior sequences attracts much attention and brings great improvements in the CTR field. Many existing works utilize attention mechanism or recurrent neural networks to exploit user interest from the sequence, but fail to recognize the simple truth that a user's real-time interests are inherently diverse and fluid. In this paper, we propose DisenCTR, a novel dynamic graph-based disentangled representation framework for CTR prediction. The key novelty of our method compared with existing approaches is to model evolving diverse interests of users. Specifically, we construct a time-evolving user-item interaction graph induced by historical interactions. And based on the rich dynamics supplied by the graph, we propose a disentangled graph representation module to extract diverse user interests. We further exploit the fluidity of user interests and model the temporal effect of historical behaviors using Mixture of Hawkes Process. Extensive experiments on three real-world datasets demonstrate the superior performance of our method comparing to state-of-the-art approaches.

References Powered by Scopus

LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation

3118Citations
N/AReaders
Get full text

Neural graph collaborative filtering

2701Citations
N/AReaders
Get full text

Deep neural networks for youtube recommendations

2473Citations
N/AReaders
Get full text

Cited by Powered by Scopus

A Comprehensive Survey on Deep Graph Representation Learning

101Citations
N/AReaders
Get full text

DisenPOI: Disentangling Sequential and Geographical Influence for Point-of-Interest Recommendation

54Citations
N/AReaders
Get full text

WinGNN: Dynamic Graph Neural Networks with Random Gradient Aggregation Window

32Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Wang, Y., Qin, Y., Sun, F., Zhang, B., Hou, X., Hu, K., … Zhang, M. (2022). DisenCTR: Dynamic Graph-based Disentangled Representation for Click-Through Rate Prediction. In SIGIR 2022 - Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 2314–2318). Association for Computing Machinery, Inc. https://doi.org/10.1145/3477495.3531851

Readers over time

‘22‘23036912

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 3

60%

Lecturer / Post doc 1

20%

Researcher 1

20%

Readers' Discipline

Tooltip

Computer Science 5

83%

Decision Sciences 1

17%

Save time finding and organizing research with Mendeley

Sign up for free
0