SigGAN : Adversarial Model for Learning Signed Relationships in Networks
- URL: http://arxiv.org/abs/2201.06437v1
- Date: Mon, 17 Jan 2022 14:53:30 GMT
- Title: SigGAN : Adversarial Model for Learning Signed Relationships in Networks
- Authors: Roshni Chakraborty, Ritwika Das, Joydeep Chandra
- Abstract summary: We propose a Generative Adversarial Network (GAN) based model for signed networks, SigGAN.
It considers the requirements of signed networks, such as, integration of information from negative edges, high imbalance in number of positive and negative edges and structural balance theory.
- Score: 2.0277446818410994
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Signed link prediction in graphs is an important problem that has
applications in diverse domains. It is a binary classification problem that
predicts whether an edge between a pair of nodes is positive or negative.
Existing approaches for link prediction in unsigned networks cannot be directly
applied for signed link prediction due to their inherent differences. Further,
additional structural constraints, like, the structural balance property of the
signed networks must be considered for signed link prediction. Recent signed
link prediction approaches generate node representations using either
generative models or discriminative models. Inspired by the recent success of
Generative Adversarial Network (GAN) based models which comprises of a
discriminator and generator in several applications, we propose a Generative
Adversarial Network (GAN) based model for signed networks, SigGAN. It considers
the requirements of signed networks, such as, integration of information from
negative edges, high imbalance in number of positive and negative edges and
structural balance theory. Comparing the performance with state of the art
techniques on several real-world datasets validates the effectiveness of
SigGAN.
Related papers
- SE-SGformer: A Self-Explainable Signed Graph Transformer for Link Sign Prediction [8.820909397907274]
Signed Graph Neural Networks (SGNNs) have been shown to be effective in analyzing complex patterns in real-world situations where positive and negative links coexist.
SGNN models suffer from poor explainability, which limit their adoptions in critical scenarios that require understanding the rationale behind predictions.
We introduce a Self-Explainable Signed Graph transformer (SE-SGformer) framework, which outputs explainable information while ensuring high prediction accuracy.
arXiv Detail & Related papers (2024-08-16T13:54:50Z) - Domain-adaptive Message Passing Graph Neural Network [67.35534058138387]
Cross-network node classification (CNNC) aims to classify nodes in a label-deficient target network by transferring the knowledge from a source network with abundant labels.
We propose a domain-adaptive message passing graph neural network (DM-GNN), which integrates graph neural network (GNN) with conditional adversarial domain adaptation.
arXiv Detail & Related papers (2023-08-31T05:26:08Z) - Resisting Graph Adversarial Attack via Cooperative Homophilous
Augmentation [60.50994154879244]
Recent studies show that Graph Neural Networks are vulnerable and easily fooled by small perturbations.
In this work, we focus on the emerging but critical attack, namely, Graph Injection Attack.
We propose a general defense framework CHAGNN against GIA through cooperative homophilous augmentation of graph data and model.
arXiv Detail & Related papers (2022-11-15T11:44:31Z) - Link Prediction with Contextualized Self-Supervision [63.25455976593081]
Link prediction aims to infer the existence of a link between two nodes in a network.
Traditional link prediction algorithms are hindered by three major challenges -- link sparsity, node attribute noise and network dynamics.
We propose a Contextualized Self-Supervised Learning framework that fully exploits structural context prediction for link prediction.
arXiv Detail & Related papers (2022-01-25T03:12:32Z) - MUSE: Multi-faceted Attention for Signed Network Embedding [4.442695760653947]
Signed network embedding is an approach to learn low-dimensional representations of nodes in signed networks with both positive and negative links.
We propose MUSE, a MUlti-faceted attention-based Signed network Embedding framework to tackle this problem.
arXiv Detail & Related papers (2021-04-29T16:09:35Z) - SDGNN: Learning Node Representation for Signed Directed Networks [43.15277366961127]
Graph Neural Networks (GNNs) have received widespread attention and lead to state-of-the-art performance in learning node representations.
It is not trivial to transfer these models to signed directed networks, which are widely observed in the real world yet less studied.
We propose a novel Signed Directed Graph Neural Networks model named SDGNN to learn node embeddings for signed directed networks.
arXiv Detail & Related papers (2021-01-07T06:15:07Z) - Interpretable Signed Link Prediction with Signed Infomax Hyperbolic
Graph [54.03786611989613]
signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes)
We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG)
In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
arXiv Detail & Related papers (2020-11-25T05:09:03Z) - Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph
Link Prediction [69.1473775184952]
We introduce a realistic problem of few-shot out-of-graph link prediction.
We tackle this problem with a novel transductive meta-learning framework.
We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
arXiv Detail & Related papers (2020-06-11T17:42:46Z) - CSNE: Conditional Signed Network Embedding [77.54225346953069]
Signed networks encode positive and negative relations between entities such as friend/foe or trust/distrust.
Existing embedding methods for sign prediction generally enforce different notions of status or balance theories in their optimization function.
We introduce conditional signed network embedding (CSNE)
Our probabilistic approach models structural information about the signs in the network separately from fine-grained detail.
arXiv Detail & Related papers (2020-05-19T19:14: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.