RUS  ENG
Full version
JOURNALS // Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia // Archive

Dokl. RAN. Math. Inf. Proc. Upr., 2023 Volume 514, Number 2, Pages 395–416 (Mi danma483)

SPECIAL ISSUE: ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING TECHNOLOGIES

No two users are alike: Generating audiences with neural clustering for temporal point processes

V. Zhuzhela, V. Grabar'a, N. Kaploukhayaa, R. Rivera-Castrobca, L. Mironovaa, A. Zaytseva, E. Burnaeva

a Skolkovo Institute of Science and Technology, Moscow, Russia
b Center for Digital Technology and Management, Munich, Germany
c Choco Communications, Berlin, Germany

Abstract: Identifying the right user to target is a common problem for different Internet platforms. Although numerous systems address this task, they are heavily tailored for specific environments and settings. It is challenging for practitioners to apply these findings to their problems. The reason is that most systems are designed for settings with millions of highly active users and with personal information, as is the case in social networks or other services with high virality. There exists a gap in the literature for systems that are for medium-sized data and where the only data available are the event sequences of a user. It motivates us to present Look-A-Liker (LAL) as an unsupervised deep cluster system. It uses temporal point processes to identify similar users for targeting tasks. We use data from the leading Internet marketplace for the gastronomic sector for experiments. LAL generalizes beyond proprietary data. Using event sequences of users, it is possible to obtain state-of-the-art results compared to novel methods such as Transformer architectures and multimodal learning. Our approach produces the up to 20% ROC AUC score improvement on real-world datasets from 0.803 to 0.959. Although LAL focuses on hundreds of thousands of sequences, we show how it quickly expands to millions of user sequences. We provide a fully reproducible implementation with code and datasets in https://github.com/adasegroup/sequence-clusterers.

Keywords: applications, clustering, unsupervised, temporal point processes.

Presented: A. I. Avetisyan
Received: 01.09.2023
Revised: 15.09.2023
Accepted: 18.10.2023

DOI: 10.31857/S2686954323601859


 English version:
Doklady Mathematics, 2023, 108:suppl. 2, S511–S528

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024