Optimizing Similar Audience Search in Targeted Advertising: Effectiveness of Siamese Networks for Autoencoder-based User Embeddings

2025

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.48084/etasr.10527
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This study investigates the effectiveness of using Siamese networks for comparing embedding vectors that describe user profiles. A model was developed to identify similar audiences in the context of targeted advertising. The analysis of the requirements for such a model revealed that traditional approaches to tabular data processing often struggle to address the unique challenges posed by this task, particularly in terms of scalability and adaptability. The proposed approach allows for the effective identification of lookalike users without relying on explicit feature engineering. This method was evaluated using an anonymized proprietary dataset provided by a telecommunications operator, which included sociodemographic descriptions of subscribers, their tariff plans, and mobile devices. Experimental results showed that the model achieved an F1 score of 0.75, a ROC-AUC of 0.79, and a lift score in the top 1 of 12.9, outperforming baseline methods in targeted user identification by 41.61% on average. The results highlight the ability of the proposed method to meet the key requirements for this task, showcasing its effectiveness and scalability. This study highlights the versatility of the proposed approach, emphasizing its applicability across various domains for tabular data classification tasks. Future research will focus on developing multiple autoencoders tailored to different domains and integrating them to solve specific tasks.