Learning Personalized Representations using Graph Convolutional Network

• URL: http://arxiv.org/abs/2207.14298v1
• Date: Thu, 28 Jul 2022 11:31:38 GMT
• Title: Learning Personalized Representations using Graph Convolutional Network
• Authors: Hongyu Shen, Jinoh Oh, Shuai Zhao, Guoyin Wang, Tara Taghavi, Sungjin Lee
• Abstract summary: 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.
• Score: 16.149897648881844
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generating representations that precisely reflect customers' behavior is an important task for providing personalized skill routing experience in Alexa. Currently, Dynamic Routing (DR) team, which is responsible for routing Alexa traffic to providers or skills, relies on two features to be served as personal signals: absolute traffic count and normalized traffic count of every skill usage per customer. Neither of them considers the network based structure for interactions between customers and skills, which contain richer information for customer preferences. In this work, we first build a heterogeneous edge attributed graph based customers' past interactions with the invoked skills, in which the user requests (utterances) are modeled as edges. Then we propose a graph convolutional network(GCN) based model, namely Personalized Dynamic Routing Feature Encoder(PDRFE), that generates personalized customer representations learned from the built graph. Compared with existing models, PDRFE is able to further capture contextual information in the graph convolutional function. The performance of our proposed model is evaluated by a downstream task, defect prediction, that predicts the defect label from the learned embeddings of customers and their triggered skills. We observe up to 41% improvements on the cross entropy metric for our proposed models compared to the baselines.

Related papers

• Federated Graph Learning with Graphless Clients [52.5629887481768]
  Federated Graph Learning (FGL) is tasked with training machine learning models, such as Graph Neural Networks (GNNs) We propose a novel framework FedGLS to tackle the problem in FGL with graphless clients.
  arXiv  Detail & Related papers  (2024-11-13T06:54:05Z)
• Personalized Federated Knowledge Graph Embedding with Client-Wise Relation Graph [49.66272783945571]
  We propose Personalized Federated knowledge graph Embedding with client-wise relation graph. PFedEG learns personalized supplementary knowledge for each client by amalgamating entity embedding from its neighboring clients. We conduct extensive experiments on four benchmark datasets to evaluate our method against state-of-the-art models.
  arXiv  Detail & Related papers  (2024-06-17T17:44:53Z)
• FedSheafHN: Personalized Federated Learning on Graph-structured Data [22.825083541211168]
  We propose a model called FedSheafHN, which embeds each client's local subgraph into a server-constructed collaboration graph. Our model improves the integration and interpretation of complex client characteristics. It also has fast model convergence and effective new clients generalization.
  arXiv  Detail & Related papers  (2024-05-25T04:51:41Z)
• PeFLL: Personalized Federated Learning by Learning to Learn [16.161876130822396]
  We present PeFLL, a new personalized federated learning algorithm that improves over the state-of-the-art in three aspects. At the core of PeFLL lies a learning-to-learn approach that jointly trains an embedding network and a hypernetwork.
  arXiv  Detail & Related papers  (2023-06-08T19:12:42Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• 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)
• Detecting Owner-member Relationship with Graph Convolution Network in Fisheye Camera System [9.665475078766017]
  We propose an innovative relationship prediction method, DeepWORD, by designing a graph convolutional network (GCN) In the experiments we learned that the proposed method achieved state-of-the-art accuracy and real-time performance.
  arXiv  Detail & Related papers  (2022-01-28T13:12:27Z)
• 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)
• 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)
• 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.