PersonaSAGE: A Multi-Persona Graph Neural Network
- URL: http://arxiv.org/abs/2212.13709v1
- Date: Wed, 28 Dec 2022 05:50:38 GMT
- Title: PersonaSAGE: A Multi-Persona Graph Neural Network
- Authors: Gautam Choudhary, Iftikhar Ahamath Burhanuddin, Eunyee Koh, Fan Du,
and Ryan A. Rossi
- Abstract summary: We develop a persona-based graph neural network framework called PersonaSAGE that learns multiple persona-based embeddings for each node in the graph.
PersonaSAGE learns the appropriate set of persona embeddings for each node in the graph, and every node can have a different number of assigned persona embeddings.
Experiments demonstrate the effectiveness of PersonaSAGE for a variety of important tasks including link prediction.
- Score: 27.680820534771485
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Graph Neural Networks (GNNs) have become increasingly important in recent
years due to their state-of-the-art performance on many important downstream
applications. Existing GNNs have mostly focused on learning a single node
representation, despite that a node often exhibits polysemous behavior in
different contexts. In this work, we develop a persona-based graph neural
network framework called PersonaSAGE that learns multiple persona-based
embeddings for each node in the graph. Such disentangled representations are
more interpretable and useful than a single embedding. Furthermore, PersonaSAGE
learns the appropriate set of persona embeddings for each node in the graph,
and every node can have a different number of assigned persona embeddings. The
framework is flexible enough and the general design helps in the wide
applicability of the learned embeddings to suit the domain. We utilize publicly
available benchmark datasets to evaluate our approach and against a variety of
baselines. The experiments demonstrate the effectiveness of PersonaSAGE for a
variety of important tasks including link prediction where we achieve an
average gain of 15% while remaining competitive for node classification.
Finally, we also demonstrate the utility of PersonaSAGE with a case study for
personalized recommendation of different entity types in a data management
platform.
Related papers
- One Node Per User: Node-Level Federated Learning for Graph Neural Networks [7.428431479479646]
We propose a novel framework for node-level federated graph learning.
We introduce a graph Laplacian term based on the feature vector's latent representation to regulate the user-side model updates.
arXiv Detail & Related papers (2024-09-29T02:16:07Z) - GraphFM: A Scalable Framework for Multi-Graph Pretraining [2.882104808886318]
We introduce a scalable multi-graph multi-task pretraining approach specifically tailored for node classification tasks across diverse graph datasets from different domains.
We demonstrate the efficacy of our approach by training a model on 152 different graph datasets comprising over 7.4 million nodes and 189 million edges.
Our results show that pretraining on a diverse array of real and synthetic graphs improves the model's adaptability and stability, while performing competitively with state-of-the-art specialist models.
arXiv Detail & Related papers (2024-07-16T16:51:43Z) - End-to-End Learning on Multimodal Knowledge Graphs [0.0]
We propose a multimodal message passing network which learns end-to-end from the structure of graphs.
Our model uses dedicated (neural) encoders to naturally learn embeddings for node features belonging to five different types of modalities.
Our results indicate that end-to-end multimodal learning from any arbitrary knowledge graph is indeed possible.
arXiv Detail & Related papers (2023-09-03T13:16:18Z) - KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot
Node Classification [75.95647590619929]
Zero-Shot Node Classification (ZNC) has been an emerging and crucial task in graph data analysis.
We propose a Knowledge-Aware Multi-Faceted framework (KMF) that enhances the richness of label semantics.
A novel geometric constraint is developed to alleviate the problem of prototype drift caused by node information aggregation.
arXiv Detail & Related papers (2023-08-15T02:38:08Z) - A Robust Stacking Framework for Training Deep Graph Models with
Multifaceted Node Features [61.92791503017341]
Graph Neural Networks (GNNs) with numerical node features and graph structure as inputs have demonstrated superior performance on various supervised learning tasks with graph data.
The best models for such data types in most standard supervised learning settings with IID (non-graph) data are not easily incorporated into a GNN.
Here we propose a robust stacking framework that fuses graph-aware propagation with arbitrary models intended for IID data.
arXiv Detail & Related papers (2022-06-16T22:46:33Z) - Graph Classification by Mixture of Diverse Experts [67.33716357951235]
We present GraphDIVE, a framework leveraging mixture of diverse experts for imbalanced graph classification.
With a divide-and-conquer principle, GraphDIVE employs a gating network to partition an imbalanced graph dataset into several subsets.
Experiments on real-world imbalanced graph datasets demonstrate the effectiveness of GraphDIVE.
arXiv Detail & Related papers (2021-03-29T14:03:03Z) - CatGCN: Graph Convolutional Networks with Categorical Node Features [99.555850712725]
CatGCN is tailored for graph learning when the node features are categorical.
We train CatGCN in an end-to-end fashion and demonstrate it on semi-supervised node classification.
arXiv Detail & Related papers (2020-09-11T09:25:17Z) - GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training [62.73470368851127]
Graph representation learning has emerged as a powerful technique for addressing real-world problems.
We design Graph Contrastive Coding -- a self-supervised graph neural network pre-training framework.
We conduct experiments on three graph learning tasks and ten graph datasets.
arXiv Detail & Related papers (2020-06-17T16:18:35Z) - Unsupervised Differentiable Multi-aspect Network Embedding [52.981277420394846]
We propose a novel end-to-end framework for multi-aspect network embedding, called asp2vec.
Our proposed framework can be readily extended to heterogeneous networks.
arXiv Detail & Related papers (2020-06-07T19:26:20Z) - End-to-End Entity Classification on Multimodal Knowledge Graphs [0.0]
We propose a multimodal message passing network which learns end-to-end from the structure of graphs.
Our model uses dedicated (neural) encoders to naturally learn embeddings for node features belonging to five different types of modalities.
Our result supports our hypothesis that including information from multiple modalities can help our models obtain a better overall performance.
arXiv Detail & Related papers (2020-03-25T14:57:52Z)
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.