Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A Unsupervised graph comparison learning-based click-through rate prediction model

View through CrossRef
Abstract Click-through rate (CTR) prediction refers to the estimation of the probability that a given user will click on a given advertisement, with the objective of displaying items of greater interest to the user. In this paper, we propose a clickthrough rate prediction model based on unsupervised graph comparison learning (USGCL-CTR) to address the issue of a decline in model prediction accuracy due to the neglecting the introduction of noise caused by useless feature interactions in existing CTR prediction models based on GNNs. To facilitate the transformation of the modeling task of feature interactions into the modeling of node interactions on the corresponding graph, the feature domain is visually represented as a graph structure following the embedding layer. Subsequently, noisy edges are removed by a designed feature interaction selection layer based on unsupervised graph comparison learning. In USGCL-CTR, we utilize metric learning to establish an ’anchor graph’, serving as a guide for the optimization of the graph structure. We then apply contrast loss to maximize the interaction information between the anchor graph and the learned structure. By eliminating unproductive feature interactions, the denoised feature map significantly enhances the precision of CTR predictions. Comparative experiments were carried out against eight baseline models on three open-source datasets. The results clearly showed that our proposed USGCL-CTR model surpassed all baseline models in performance.
Springer Science and Business Media LLC
Title: A Unsupervised graph comparison learning-based click-through rate prediction model
Description:
Abstract Click-through rate (CTR) prediction refers to the estimation of the probability that a given user will click on a given advertisement, with the objective of displaying items of greater interest to the user.
In this paper, we propose a clickthrough rate prediction model based on unsupervised graph comparison learning (USGCL-CTR) to address the issue of a decline in model prediction accuracy due to the neglecting the introduction of noise caused by useless feature interactions in existing CTR prediction models based on GNNs.
To facilitate the transformation of the modeling task of feature interactions into the modeling of node interactions on the corresponding graph, the feature domain is visually represented as a graph structure following the embedding layer.
Subsequently, noisy edges are removed by a designed feature interaction selection layer based on unsupervised graph comparison learning.
In USGCL-CTR, we utilize metric learning to establish an ’anchor graph’, serving as a guide for the optimization of the graph structure.
We then apply contrast loss to maximize the interaction information between the anchor graph and the learned structure.
By eliminating unproductive feature interactions, the denoised feature map significantly enhances the precision of CTR predictions.
Comparative experiments were carried out against eight baseline models on three open-source datasets.
The results clearly showed that our proposed USGCL-CTR model surpassed all baseline models in performance.

Related Results

Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Drug–target affinity prediction with extended graph learning-convolutional networks
Drug–target affinity prediction with extended graph learning-convolutional networks
Abstract Background High-performance computing plays a pivotal role in computer-aided drug design, a field that holds significant promise in pharmac...
Research on the design of teaching aid resource system based on unsupervised representation learning
Research on the design of teaching aid resource system based on unsupervised representation learning
In the absence of manual annotation information, using only the topology information of the graph to achieve unsupervised graph alignment has always been one of the important chall...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Graph-based prediction of Protein-protein interactions with attributed signed graph embedding
Graph-based prediction of Protein-protein interactions with attributed signed graph embedding
Abstract Background Protein-protein interactions (PPIs) are central to many biological processes. Considering that the experimental methods for identifying PPIs are time-consuming ...
Design and analysis of dual-curing systems
Design and analysis of dual-curing systems
Dual-curing processing is a method to prepare thermoset materials through two polymerization reactions carried out simultaneously or sequentially. In these processes, a firm under...
Self-Supervised Based Multi-View Graph Presentation Learning for Drug-Drug Interaction Prediction
Self-Supervised Based Multi-View Graph Presentation Learning for Drug-Drug Interaction Prediction
Article Self-Supervised Based Multi-View Graph Presentation Learning for Drug-Drug Interaction Prediction Kuang Du 1,  Jing Du 2 and Zhi Wei 1,* 1 Department of Computer Science...
The Complexity of Pencil Graph and Line Pencil Graph
The Complexity of Pencil Graph and Line Pencil Graph
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. T...

Back to Top