Proceedings of the ACM Web Conference 2023 2023
DOI: 10.1145/3543507.3583221
|View full text |Cite
|
Sign up to set email alerts
|

RSGNN: A Model-agnostic Approach for Enhancing the Robustness of Signed Graph Neural Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 37 publications
0
1
0
Order By: Relevance
“…Signed Graph Representation Learning Methods: Predicting student performance involves the unique task of sign prediction in a signed bipartite graph, where positive edges signify correct answers and negative edges denote incorrect ones (Derr, Ma, and Tang 2018;Zhang et al 2023b). Traditional methods like SIDE (Kim et al 2018) and SGDN (Jung, Yoo, and Kang 2020) leveraged random walks, while neural-based approaches like SGCN (Derr, Ma, and Tang 2018) extended Graph Convolutional Networks (GCN) (Kipf and Welling 2016) to balance theory-guided sign prediction.…”
Section: Related Workmentioning
confidence: 99%
“…Signed Graph Representation Learning Methods: Predicting student performance involves the unique task of sign prediction in a signed bipartite graph, where positive edges signify correct answers and negative edges denote incorrect ones (Derr, Ma, and Tang 2018;Zhang et al 2023b). Traditional methods like SIDE (Kim et al 2018) and SGDN (Jung, Yoo, and Kang 2020) leveraged random walks, while neural-based approaches like SGCN (Derr, Ma, and Tang 2018) extended Graph Convolutional Networks (GCN) (Kipf and Welling 2016) to balance theory-guided sign prediction.…”
Section: Related Workmentioning
confidence: 99%