Audience Expansion for Multi-show Release Based on an Edge-prompted Heterogeneous Graph Network

• URL: http://arxiv.org/abs/2304.05474v1
• Date: Sat, 8 Apr 2023 15:14:32 GMT
• Title: Audience Expansion for Multi-show Release Based on an Edge-prompted Heterogeneous Graph Network
• Authors: Kai Song, Shaofeng Wang, Ziwei Xie, Shanyu Wang, Jiahong Li, Yongqiang Yang
• Abstract summary: 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.
• Score: 5.8720142291102135
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the user targeting and expanding of new shows on a video platform, the key point is how their embeddings are generated. It's supposed to be personalized from the perspective of both users and shows. Furthermore, the pursue of both instant (click) and long-time (view time) rewards, and the cold-start problem for new shows bring additional challenges. Such a problem is suitable for processing by heterogeneous graph models, because of the natural graph structure of data. But real-world networks usually have billions of nodes and various types of edges. Few existing methods focus on handling large-scale data and exploiting different types of edges, especially the latter. In this paper, we propose a two-stage audience expansion scheme based on an edge-prompted heterogeneous graph network which can take different double-sided interactions and features into account. In the offline stage, to construct the graph, user IDs and specific side information combinations of the shows are chosen to be the nodes, and click/co-click relations and view time are used to build the edges. Embeddings and clustered user groups are then calculated. When new shows arrive, their embeddings and subsequent matching users can be produced within a consistent space. In the online stage, posterior data including click/view users are employed as seeds to look for similar users. The results on the public datasets and our billion-scale data demonstrate the accuracy and efficiency of our approach.

Related papers

• InstructG2I: Synthesizing Images from Multimodal Attributed Graphs [50.852150521561676]
  We propose a graph context-conditioned diffusion model called InstructG2I. InstructG2I first exploits the graph structure and multimodal information to conduct informative neighbor sampling. A Graph-QFormer encoder adaptively encodes the graph nodes into an auxiliary set of graph prompts to guide the denoising process.
  arXiv  Detail & Related papers  (2024-10-09T17:56:15Z)
• OpenGraph: Towards Open Graph Foundation Models [20.401374302429627]
  Graph Neural Networks (GNNs) have emerged as promising techniques for encoding structural information. Key challenge remains: the difficulty of generalizing to unseen graph data with different properties. We propose a novel graph foundation model, called OpenGraph, to address this challenge.
  arXiv  Detail & Related papers  (2024-03-02T08:05:03Z)
• Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modeling [60.0185734837814]
  Graph neural networks (GNNs) have found extensive applications in learning from graph data. To bolster the generalization capacity of GNNs, it has become customary to augment training graph structures with techniques like graph augmentations. This study introduces the concept of Mixture-of-Experts (MoE) to GNNs, with the aim of augmenting their capacity to adapt to a diverse range of training graph structures.
  arXiv  Detail & Related papers  (2023-04-06T01:09:36Z)
• DoubleH: Twitter User Stance Detection via Bipartite Graph Neural Networks [9.350629400940493]
  We crawl a large-scale dataset of the 2020 US presidential election and automatically label all users by manually tagged hashtags. We propose a bipartite graph neural network model, DoubleH, which aims to better utilize homogeneous and heterogeneous information in user stance detection tasks.
  arXiv  Detail & Related papers  (2023-01-20T19:20:10Z)
• Modeling and Mining Multi-Aspect Graphs With Scalable Streaming Tensor Decomposition [1.5609988622100528]
  We propose novel methods for mining static and dynamic multi-aspect graphs. The goal is to identify coherent communities and patterns between nodes by leveraging the tensor structure in the data. As our graphs evolve dynamically, we focus on handling such streaming updates in the data without having to re-compute the decomposition.
  arXiv  Detail & Related papers  (2022-10-10T02:26:00Z)
• Evidential Temporal-aware Graph-based Social Event Detection via Dempster-Shafer Theory [76.4580340399321]
  We propose ETGNN, a novel Evidential Temporal-aware Graph Neural Network. We construct view-specific graphs whose nodes are the texts and edges are determined by several types of shared elements respectively. Considering the view-specific uncertainty, the representations of all views are converted into mass functions through evidential deep learning (EDL) neural networks.
  arXiv  Detail & Related papers  (2022-05-24T16:22:40Z)
• Representing Videos as Discriminative Sub-graphs for Action Recognition [165.54738402505194]
  We introduce a new design of sub-graphs to represent and encode theriminative patterns of each action in the videos. We present MUlti-scale Sub-Earn Ling (MUSLE) framework that novelly builds space-time graphs and clusters into compact sub-graphs on each scale.
  arXiv  Detail & Related papers  (2022-01-11T16:15:25Z)
• Context-aware Heterogeneous Graph Attention Network for User Behavior Prediction in Local Consumer Service Platform [8.30503479549857]
  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.
  arXiv  Detail & Related papers  (2021-06-24T03:08:21Z)
• GraphMI: Extracting Private Graph Data from Graph Neural Networks [59.05178231559796]
  We present textbfGraph textbfModel textbfInversion attack (GraphMI), which aims to extract private graph data of the training graph by inverting GNN. Specifically, we propose a projected gradient module to tackle the discreteness of graph edges while preserving the sparsity and smoothness of graph features. We design a graph auto-encoder module to efficiently exploit graph topology, node attributes, and target model parameters for edge inference.
  arXiv  Detail & Related papers  (2021-06-05T07:07:52Z)
• Edge-Featured Graph Attention Network [7.0629162428807115]
  We present edge-featured graph attention networks (EGATs) to extend the use of graph neural networks to those tasks learning on graphs with both node and edge features. By reforming the model structure and the learning process, the new models can accept node and edge features as inputs, incorporate the edge information into feature representations, and iterate both node and edge features in a parallel but mutual way.
  arXiv  Detail & Related papers  (2021-01-19T15:08:12Z)
• Exploiting Heterogeneous Graph Neural Networks with Latent Worker/Task Correlation Information for Label Aggregation in Crowdsourcing [72.34616482076572]
  Crowdsourcing has attracted much attention for its convenience to collect labels from non-expert workers instead of experts. We propose a novel framework based on graph neural networks for aggregating crowd labels.
  arXiv  Detail & Related papers  (2020-10-25T10:12:37Z)

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.