Context-aware Heterogeneous Graph Attention Network for User Behavior Prediction in Local Consumer Service Platform

• URL: http://arxiv.org/abs/2106.14652v1
• Date: Thu, 24 Jun 2021 03:08:21 GMT
• Title: Context-aware Heterogeneous Graph Attention Network for User Behavior Prediction in Local Consumer Service Platform
• Authors: Peiyuan Zhu, Xiaofeng Wang
• Abstract summary: Local consumer service platform provides users with software to consume service to the nearby store or to the home, such as Groupon and Koubei. The behavior of users on the local consumer service platform is closely related to their real-time local context information. We propose a context-aware heterogeneous graph attention network (CHGAT) to generate the representation of the user and to estimate the probability for future behavior.
• Score: 8.30503479549857
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: As a new type of e-commerce platform developed in recent years, local consumer service platform provides users with software to consume service to the nearby store or to the home, such as Groupon and Koubei. Different from other common e-commerce platforms, the behavior of users on the local consumer service platform is closely related to their real-time local context information. Therefore, building a context-aware user behavior prediction system is able to provide both merchants and users better service in local consumer service platforms. However, most of the previous work just treats the contextual information as an ordinary feature into the prediction model to obtain the prediction list under a specific context, which ignores the fact that the interest of a user in different contexts is often significantly different. Hence, in this paper, we propose a context-aware heterogeneous graph attention network (CHGAT) to dynamically generate the representation of the user and to estimate the probability for future behavior. Specifically, we first construct the meta-path based heterogeneous graphs with the historical behaviors from multiple sources and comprehend heterogeneous vertices in the graph with a novel unified knowledge representing approach. Next, a multi-level attention mechanism is introduced for context-aware aggregation with graph vertices, which contains the vertex-level attention network and the path-level attention network. Both of them aim to capture the semantic correlation between information contained in the graph and the outside real-time contextual information in the search system. Then the model proposed in this paper aggregates specific graphs with their corresponding context features and obtains the representation of user interest under a specific context and input it into the prediction network to finally obtain the predicted probability of user behavior.

Related papers

• Audience Expansion for Multi-show Release Based on an Edge-prompted Heterogeneous Graph Network [5.8720142291102135]
  We propose a two-stage audience expansion scheme based on an edge-prompted heterogeneous graph network. In the offline stage, to construct the graph, user IDs and specific side information combinations of the shows are chosen to be the nodes. In the online stage, posterior data including click/view users are employed as seeds to look for similar users.
  arXiv  Detail & Related papers  (2023-04-08T15:14:32Z)
• DIGMN: Dynamic Intent Guided Meta Network for Differentiated User Engagement Forecasting in Online Professional Social Platforms [32.70471436337077]
  A major reason for the differences in user engagement patterns is that users have different intents. We propose a Dynamic Guided Meta Network (DIGMN) which can explicitly model user intent varying with time. Our method outperforms state-of-the-art baselines significantly.
  arXiv  Detail & Related papers  (2022-10-22T09:57:27Z)
• 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)
• Learning Personalized Representations using Graph Convolutional Network [16.149897648881844]
  We propose a graph convolutional network based model, namely Personalized Dynamic Routing Feature(PDRFE) PDRFE generates personalized customer representations learned from the built graph. We observe up to 41% improvements on the cross entropy metric for our proposed models compared to the baselines.
  arXiv  Detail & Related papers  (2022-07-28T11:31:38Z)
• 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)
• In the Eye of the Beholder: Robust Prediction with Causal User Modeling [27.294341513692164]
  We propose a learning framework for relevance prediction that is robust to changes in the data distribution. Our key observation is that robustness can be obtained by accounting for how users causally perceive the environment.
  arXiv  Detail & Related papers  (2022-06-01T11:33:57Z)
• Conditional Attention Networks for Distilling Knowledge Graphs in Recommendation [74.14009444678031]
  We propose Knowledge-aware Conditional Attention Networks (KCAN) to incorporate knowledge graph into a recommender system. We use a knowledge-aware attention propagation manner to obtain the node representation first, which captures the global semantic similarity on the user-item network and the knowledge graph. Then, by applying a conditional attention aggregation on the subgraph, we refine the knowledge graph to obtain target-specific node representations.
  arXiv  Detail & Related papers  (2021-11-03T09:40:43Z)
• Temporal Graph Network Embedding with Causal Anonymous Walks Representations [54.05212871508062]
  We propose a novel approach for dynamic network representation learning based on Temporal Graph Network. For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings. We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
  arXiv  Detail & Related papers  (2021-08-19T15:39:52Z)
• GCN-ALP: Addressing Matching Collisions in Anchor Link Prediction [40.811988657941946]
  The problem textitanchor link prediction is formalized to link user data with the common ground on user profile, content and network structure across social networks. We propose graph convolution networks with mini-batch strategy, efficiently solving anchor link prediction on matching graph.
  arXiv  Detail & Related papers  (2021-03-19T02:41:55Z)
• 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)
• Disentangled Graph Collaborative Filtering [100.26835145396782]
  Disentangled Graph Collaborative Filtering (DGCF) is a new model for learning informative representations of users and items from interaction data. By modeling a distribution over intents for each user-item interaction, we iteratively refine the intent-aware interaction graphs and representations. DGCF achieves significant improvements over several state-of-the-art models like NGCF, DisenGCN, and MacridVAE.
  arXiv  Detail & Related papers  (2020-07-03T15:37:25Z)

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.