Light-weight End-to-End Graph Interest Network for CTR Prediction in E-commerce Search

• URL: http://arxiv.org/abs/2406.17745v3
• Date: Thu, 4 Jul 2024 17:52:06 GMT
• Title: Light-weight End-to-End Graph Interest Network for CTR Prediction in E-commerce Search
• Authors: Pipi Peng, Yunqing Jia, Ziqiang Zhou, murmurhash, Zichong Xiao,
• Abstract summary: We propose a new approach named Light-weight End-to-End Graph Interest Network (EGIN) to effectively mine users' search interests. The proposed EGIN is composed of three parts: query-item heterogeneous graph, light-weight graph sampling, and multi-interest network. We conduct extensive experiments on both public and industrial datasets to demonstrate the effectiveness of the proposed EGIN.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Click-through-rate (CTR) prediction has an essential impact on improving user experience and revenue in e-commerce search. With the development of deep learning, graph-based methods are well exploited to utilize graph structure extracted from user behaviors and other information to help embedding learning. However, most of the previous graph-based methods mainly focus on recommendation scenarios, and therefore their graph structures highly depend on item's sequential information from user behaviors, ignoring query's sequential signal and query-item correlation. In this paper, we propose a new approach named Light-weight End-to-End Graph Interest Network (EGIN) to effectively mine users' search interests and tackle previous challenges. (i) EGIN utilizes query and item's correlation and sequential information from the search system to build a heterogeneous graph for better CTR prediction in e-commerce search. (ii) EGIN's graph embedding learning shares the same training input and is jointly trained with CTR prediction, making the end-to-end framework effortless to deploy in large-scale search systems. The proposed EGIN is composed of three parts: query-item heterogeneous graph, light-weight graph sampling, and multi-interest network. The query-item heterogeneous graph captures correlation and sequential information of query and item efficiently by the proposed light-weight graph sampling. The multi-interest network is well designed to utilize graph embedding to capture various similarity relationships between query and item to enhance the final CTR prediction. We conduct extensive experiments on both public and industrial datasets to demonstrate the effectiveness of the proposed EGIN. At the same time, the training cost of graph learning is relatively low compared with the main CTR prediction task, ensuring efficiency in practical applications.

Related papers

• CFRecs: Counterfactual Recommendations on Real Estate User Listing Interaction Graphs [0.4369550829556577]
  This paper introduces CFRecs, a framework that transforms counterfactual explanations into actionable insights.<n>We apply CFRecs to Zillow's graph-structured data to deliver actionable recommendations for both home buyers and sellers.
  arXiv  Detail & Related papers  (2026-02-05T16:42:51Z)
• Graph-Anchored Knowledge Indexing for Retrieval-Augmented Generation [53.42323544075114]
  We propose GraphAnchor, a novel Graph-Anchored Knowledge Indexing approach.<n> Experiments on four multi-hop question answering benchmarks demonstrate the effectiveness of GraphAnchor.
  arXiv  Detail & Related papers  (2026-01-23T05:41:05Z)
• Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs [0.0]
  We focus on KBGAT, a graph neural network model that leverages multi-head attention to jointly encode both entity and relation features within local neighborhood structures.<n>We introduce textbfGCAT (Graph Collaborative Attention Network), a refined model that enhances context aggregation and interaction between heterogeneous nodes.<n>Our findings highlight the advantages of attention-based architectures in capturing complex relational patterns for knowledge graph completion tasks.
  arXiv  Detail & Related papers  (2025-07-05T08:13:09Z)
• GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network [5.027047552301203]
  We propose GraphEdge, an efficient GNN-based edge computing architecture. It considers the EC system of GNN tasks, where there are associations between users and it needs to take into account the task data of its neighbors. Based on the optimized graph layout, our proposed deep reinforcement learning (DRL) based graph offloading algorithm (DRLGO) is executed.
  arXiv  Detail & Related papers  (2025-04-22T13:45:13Z)
• Graph Contrastive Learning on Multi-label Classification for Recommendations [34.785207813971134]
  We propose a model called Graph Contrastive Learning for Multi-label Classification (MCGCL) MCGCL leverages contrastive learning to enhance recommendation effectiveness. We assess the performance using real-world datasets from Amazon Reviews in multi-label classification tasks.
  arXiv  Detail & Related papers  (2025-01-13T00:29:29Z)
• Amplify Graph Learning for Recommendation via Sparsity Completion [16.32861024767423]
  Graph learning models have been widely deployed in collaborative filtering (CF) based recommendation systems. Due to the issue of data sparsity, the graph structure of the original input lacks potential positive preference edges. We propose an Amplify Graph Learning framework based on Sparsity Completion (called AGL-SC)
  arXiv  Detail & Related papers  (2024-06-27T08:26:20Z)
• You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction [79.15394378571132]
  We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
  arXiv  Detail & Related papers  (2023-02-27T22:56:06Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Graph Collaborative Reasoning [18.45161138837384]
  Graph Collaborative Reasoning (GCR) can use the neighbor link information for relational reasoning on graphs from logical reasoning perspectives. We provide a simple approach to translate a graph structure into logical expressions, so that the link prediction task can be converted into a neural logic reasoning problem. To show the effectiveness of our work, we conduct experiments on graph-related tasks such as link prediction and recommendation based on commonly used benchmark datasets.
  arXiv  Detail & Related papers  (2021-12-27T14:27:58Z)
• r-GAT: Relational Graph Attention Network for Multi-Relational Graphs [8.529080554172692]
  Graph Attention Network (GAT) focuses on modelling simple undirected and single relational graph data only. We propose r-GAT, a relational graph attention network to learn multi-channel entity representations. Experiments on link prediction and entity classification tasks show that our r-GAT can model multi-relational graphs effectively.
  arXiv  Detail & Related papers  (2021-09-13T12:43:00Z)
• Graph Learning based Recommender Systems: A Review [111.43249652335555]
  Graph Learning based Recommender Systems (GLRS) employ advanced graph learning approaches to model users' preferences and intentions as well as items' characteristics for recommendations. We provide a systematic review of GLRS, by discussing how they extract important knowledge from graph-based representations to improve the accuracy, reliability and explainability of the recommendations.
  arXiv  Detail & Related papers  (2021-05-13T14:50:45Z)
• Graph Intention Network for Click-through Rate Prediction in Sponsored Search [7.8836754883280555]
  Estimating click-through rate (CTR) accurately has an essential impact on improving user experience and revenue in sponsored search. Most of the current work is to mine their intentions based on user real-time behaviors. We propose a new approach Graph Intention Network (GIN) based on co-occurrence commodity graph to mine user intention.
  arXiv  Detail & Related papers  (2021-03-30T08:44:16Z)
• Jointly Cross- and Self-Modal Graph Attention Network for Query-Based Moment Localization [77.21951145754065]
  We propose a novel Cross- and Self-Modal Graph Attention Network (CSMGAN) that recasts this task as a process of iterative messages passing over a joint graph. Our CSMGAN is able to effectively capture high-order interactions between two modalities, thus enabling a further precise localization.
  arXiv  Detail & Related papers  (2020-08-04T08:25:24Z)
• Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning [82.46332224556257]
  We propose a novel adversarial learning approach by leveraging user interaction data for the Knowledge Graph Completion task. Our generator is isolated from user interaction data, and serves to improve the performance of the discriminator. To discover implicit entity preference of users, we design an elaborate collaborative learning algorithms based on graph neural networks.
  arXiv  Detail & Related papers  (2020-03-28T05:47:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.