Research map / Graph learning / Graph self-supervised learning
Supervised User Ranking in Signed Social Networks
Xiaoming Li, Hui Fang, Jie Zhang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| learn personalized supervised link strengths (SSRW) vs unsupervised signed RWR | random walk ranking · Epinions d>=3 | GAUC: 0.628 -> 0.678 | Improved |
| personalized per-seed loss (SSRW) instead of global loss (G-SSRW) (ablation) | SSRW · Epinions d>=3 | GAUC: 0.644 -> 0.678 | Improved |
| personalized per-seed loss (SSRW) instead of global loss (G-SSRW) (ablation) | SSRW · Wikipedia d>=3 | GAUC: 0.583 -> 0.633 | Improved |
| personalized per-seed loss (SSRW) instead of global loss (G-SSRW) (ablation) | SSRW · Slashdot d>=10 | GAUC: 0.658 -> 0.715 | Mixed |
| use fast local-structure ranking F-SSRW instead of full SSRW (ablation) | SSRW · Epinions d>=3 | GAUC: 0.678 -> 0.639 | Hurt |
| use F-SSRW instead of SSRW as candidates require more common neighbors (d>=10) (ablation) | SSRW · Slashdot d>=10 | GAUC: 0.715 -> 0.718 | No clear effect |
| SSRW vs best existing baseline (SFM) at d>=10 (ablation) | SSRW · Wikipedia d>=10 | GAUC: 0.679 -> 0.681 | No clear effect |
| SSRW vs best baseline (RWR) (ablation) | SSRW · Bitcoin d>=3 | GAUC: 0.613 -> 0.601 | Hurt |
| vary restart probability c from 0.1 to 0.9 (ablation) | SSRW · four signed networks, d>=5 | GAUC | No clear effect |
Closest papers by meaning
- FILE: A Novel Framework for Predicting Social Status in Signed Networks (AAAI 2018 · similarity 0.88)
- Ranking Users in Social Networks With Higher-Order Structures (AAAI 2018 · similarity 0.85)
- Optimizing Social Network Interventions via Hypergradient-Based Recommender System Design (ICML 2025 · similarity 0.84)
- An Efficient Local Search Approach for Polarized Community Discovery in Signed Networks (NeurIPS 2025 · similarity 0.84)
- Near-Neighbor Methods in Random Preference Completion (AAAI 2019 · similarity 0.84)
- How Many Pairwise Preferences Do We Need to Rank a Graph Consistently? (AAAI 2019 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
