| Author: | Zhou, Jialong |
| Title: | Adversarial analysis of signed graphs with balance theory |
| Advisors: | Zhou, Kai (COMP) |
| Degree: | M.Phil. |
| Year: | 2025 |
| Department: | Department of Computing |
| Pages: | xiii, 81 pages : color illustrations |
| Language: | English |
| Abstract: | Signed graphs have emerged as effective models for capturing positive and negative relationships in social networks. To analyze such graphs, signed graph neural networks (SGNNs) have been widely employed, leveraging the unique structural characteristics of signed graphs. However, it is surprising to discover that the balance theory, which is commonly integrated into SGNNs to effectively model positive and negative links, can unintentionally serve as a vulnerability, susceptible to exploitation as a black-box attack. In this study, we introduce a novel black-box attack termed balance-attack, specifically designed to diminish the balance degree of signed graphs. To address the associated NP-hard optimization problem, we propose an efficient heuristic algorithm. Furthermore, combating various adversarial attacks on signed graphs has become an urgent concern. We observe that these attacks often result in a reduction of the balance degree in signed graphs. Similar to the restoration of unsigned graphs through structural learning, we propose balance learning techniques to improve the balance degree of compromised graphs. However, we encounter the challenge of "Irreversibility of Balance-related Information", wherein the restored edges may not align with the original targets of the attacks, leading to suboptimal defense effectiveness. To overcome this challenge, we present a robust SGNN framework called Balance Augmented-Signed Graph Contrastive Learning (BA-SGCL), which integrates Graph Contrastive Learning principles with balance augmentation techniques. This approach facilitates the attainment of a high balance degree in the latent space, indirectly addressing the challenge of "Irreversibility of Balance-related Information". We extensively evaluate our proposed balance-attack and robust BA-SGCL on multiple popular SGNN models and real-world datasets. The experimental results validate the effectiveness of balance-attack and the resilience of BA-SGCL. This research significantly contributes to enhancing the security and reliability of signed graph analysis within the context of social network modeling. |
| Rights: | All rights reserved |
| Access: | open access |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/13757