Pith. sign in

REVIEW 1 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

arxiv 2012.14191 v1 pith:LJPXMMIW submitted 2020-12-28 cs.LG cs.SI

classification cs.LGcs.SI
keywords signedgraphnetworkgraphsnodelearninglinkprediction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Robust Deep Signed Graph Clustering via Weak Balance Theory

    cs.SI 2025-02 conditional novelty 6.0 of 10

    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.

Pith tools