REVIEW 3 cited by
Signed Graph Diffusion Network
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Given a signed social graph, how can we learn appropriate node representations to infer the signs of missing edges? Signed social graphs have received considerable attention to model trust relationships. Learning node representations is crucial to effectively analyze graph data, and various techniques such as network embedding and graph convolutional network (GCN) have been proposed for learning signed graphs. However, traditional network embedding methods are not end-to-end for a specific task such as link sign prediction, and GCN-based methods suffer from a performance degradation problem when their depth increases. In this paper, we propose Signed Graph Diffusion Network (SGDNet), a novel graph neural network that achieves end-to-end node representation learning for link sign prediction in signed social graphs. We propose a random walk technique specially designed for signed graphs so that SGDNet effectively diffuses hidden node features. Through extensive experiments, we demonstrate that SGDNet outperforms state-of-the-art models in terms of link sign prediction accuracy.
Forward citations
Cited by 3 Pith papers
-
Robust Deep Signed Graph Clustering via Weak Balance Theory
DSGC improves K-way signed graph clustering by denoising edge signs, augmenting graph structure, and training a weak-balance encoder that separates negatively linked nodes.
-
Graph Spring Neural ODEs for Link Sign Prediction
A small learned spring dynamics, trained on one signed graph, produces link sign predictions on other graphs via fast ODE simulation, with accuracy near existing methods and large speedups.
-
Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs
ELISE combines signed personalized message passing with low-rank graph refinement to predict link signs in signed bipartite graphs faster and more accurately than previous GNN methods.
Discussion (0). Continue with ORCID to comment.