Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Link Polarity Prediction from Sparse and Noisy Labels via Multiscale Social Balance (2407.15643v1)

Published 22 Jul 2024 in cs.SI and cs.LG

Abstract: Signed Graph Neural Networks (SGNNs) have recently gained attention as an effective tool for several learning tasks on signed networks, i.e., graphs where edges have an associated polarity. One of these tasks is to predict the polarity of the links for which this information is missing, starting from the network structure and the other available polarities. However, when the available polarities are few and potentially noisy, such a task becomes challenging. In this work, we devise a semi-supervised learning framework that builds around the novel concept of \emph{multiscale social balance} to improve the prediction of link polarities in settings characterized by limited data quantity and quality. Our model-agnostic approach can seamlessly integrate with any SGNN architecture, dynamically reweighting the importance of each data sample while making strategic use of the structural information from unlabeled edges combined with social balance theory. Empirical validation demonstrates that our approach outperforms established baseline models, effectively addressing the limitations imposed by noisy and sparse data. This result underlines the benefits of incorporating multiscale social balance into SGNNs, opening new avenues for robust and accurate predictions in signed network analysis.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. Social balance on networks: The dynamics of friendship and enmity. Physica D 224, 130 (2006).
  2. Multilevel structural evaluation of signed directed social networks based on balance theory. Scientific reports 10, 1 (2020), 15228.
  3. Signed Link Analysis in Social Media Networks. In International AAAI Conference on Web and Social Media (ICWSM). 539–542.
  4. Mixmatch: A holistic approach to semi-supervised learning. Advances in neural information processing systems 32 (2019).
  5. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008, 10 (2008), P10008.
  6. Discovering polarized communities in signed networks. In Proceedings of the 28th acm international conference on information and knowledge management. 961–970.
  7. Line graphs, root systems, and elliptic geometry. In Geometry and Combinatorics. Elsevier, 208–230.
  8. Curriculum labeling: Revisiting pseudo-labeling for semi-supervised learning. In Proceedings of the AAAI conference on artificial intelligence, Vol. 35. 6912–6920.
  9. ” Bridge” Enhanced Signed Directed Network Embedding. In Proceedings of the 27th ACM international conference on information and knowledge management. 773–782.
  10. Signed graph convolutional networks. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 929–934.
  11. Structural balance in signed digraphs: considering transitivity to measure balance in graphs constructed by using different link signing methods. arXiv preprint arXiv:2006.02565 (2020).
  12. Non-polar opposites: analyzing the relationship between echo chambers and hostile intergroup interactions on Reddit. In Proceedings of the International AAAI Conference on Web and Social Media, Vol. 17. 197–208.
  13. Nancy Girdhar and KK Bharadwaj. 2017. Signed social networks: a survey. In Advances in Computing and Data Sciences: First International Conference, ICACDS 2016, Ghaziabad, India, November 11-12, 2016, Revised Selected Papers 1. Springer, 326–335.
  14. Bingjie Hao and István A Kovács. 2024. Proper network randomization is key to assessing social balance. Science Advances 10, 18 (2024), eadj0104.
  15. Frank Harary. 1953. On the notion of balance of a signed graph. The Michigan Mathematical Journal 2, 2 (1953), 143–146.
  16. PyTorch Geometric Signed Directed: A Software Package on Graph Neural Networks for Signed and Directed Graphs. arXiv preprint arXiv:2202.10793 (2022).
  17. Fritz Heider. 1946. Attitudes and cognitive organization. The Journal of psychology 21 (1946), 107–112.
  18. Signed graph attention networks. In Artificial Neural Networks and Machine Learning–ICANN 2019: Workshop and Special Sessions: 28th International Conference on Artificial Neural Networks, Munich, Germany, September 17–19, 2019, Proceedings 28. Springer, 566–577.
  19. SDGNN: Learning node representation for signed directed networks. In Proceedings of the AAAI conference on artificial intelligence, Vol. 35. 196–203.
  20. Pole: Polarized embedding for signed networks. In Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining. 390–400.
  21. Rose: Role-based signed network embedding. In Proceedings of the Web Conference 2020. 2782–2788.
  22. TrustSGCN: Learning Trustworthiness on Edge Signs for Effective Signed Graph Convolutional Networks. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2451–2455.
  23. Semi-supervised learning with deep generative models. Advances in neural information processing systems 27 (2014).
  24. Thomas N Kipf and Max Welling. 2016. Semi-Supervised Classification with Graph Convolutional Networks. In International Conference on Learning Representations.
  25. The slashdot zoo: mining a social network with negative edges. In Proceedings of the 18th International Conference on World Wide Web, WWW 2009, Madrid, Spain, April 20-24, 2009, Juan Quemada, Gonzalo León, Yoëlle S. Maarek, and Wolfgang Nejdl (Eds.). 741–750.
  26. Signed networks in social media. In Proceedings of the SIGCHI conference on human factors in computing systems. 1361–1370.
  27. Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In Proceedings of the sixth ACM international conference on Web search and data mining (WSDM). 657–666.
  28. Signed Laplacian graph neural networks. In Proceedings of the AAAI conference on artificial intelligence, Vol. 37. 4444–4452.
  29. Signed graph neural network with latent groups. In Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining. 1066–1075.
  30. Learning to recommend with trust and distrust relationships. In Proceedings of the 3rd ACM conference on Recommender systems. 189–196.
  31. The energy landscape of social balance. Physical Review Letters 103, 19 (2009).
  32. Learning to reweight examples for robust deep learning. In International conference on machine learning. PMLR, 4334–4343.
  33. In Defense of Pseudo-Labeling: An Uncertainty-Aware Pseudo-label Selection Framework for Semi-Supervised Learning. In International Conference on Learning Representations.
  34. SGCL: Contrastive Representation Learning for Signed Graphs. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 1671–1680.
  35. Rahul Singh and Yongxin Chen. 2022. Signed Graph Neural Networks: A Frequency Perspective. Transactions on Machine Learning Research (2022).
  36. Fixmatch: Simplifying semi-supervised learning with consistency and confidence. Advances in neural information processing systems 33 (2020), 596–608.
  37. Learning from noisy labels with deep neural networks: A survey. IEEE transactions on neural networks and learning systems (2022).
  38. Graph agreement models for semi-supervised learning. Advances in Neural Information Processing Systems 32 (2019).
  39. Stable community detection in signed social networks. IEEE Transactions on Knowledge and Data Engineering 34, 10 (2020), 5051–5055.
  40. Node classification in signed social networks. In Proceedings of the 2016 SIAM international conference on data mining. SIAM, 54–62.
  41. A Survey of Signed Network Mining in Social Media. ACM Comput. Surv. 49, 3 (2016), 42:1–42:37.
  42. Discovering conflicting groups in signed networks. Advances in Neural Information Processing Systems 33 (2020), 10974–10985.
  43. Atypical combinations and scientific impact. Science 342, 6157 (2013), 468–472.
  44. Graph Attention Networks. In International Conference on Learning Representations.
  45. Trust-and distrust-based recommendations for controversial reviews. IEEE Intelligent Systems 26, 1 (2011), 48–55.
  46. A survey on deep semi-supervised learning. IEEE Transactions on Knowledge and Data Engineering 35, 9 (2022), 8934–8954.
  47. SNE: signed network embedding. In Advances in Knowledge Discovery and Data Mining: 21st Pacific-Asia Conference, PAKDD 2017, Jeju, South Korea, May 23-26, 2017, Proceedings, Part II 21. Springer, 183–195.
  48. Rsgnn: A model-agnostic approach for enhancing the robustness of signed graph neural networks. In Proceedings of the ACM Web Conference 2023. 60–70.
  49. Signed Graph Representation Learning: A Survey. arXiv preprint arXiv:2402.15980 (2024).
  50. Community identification in signed networks: a k-truss based model. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 2321–2324.
  51. Xiaojin Zhu and Zoubin Ghahramani. 2002. Learning from labeled and unlabeled data with label propagation. ProQuest number: information to all users (2002).

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now