TrustSGCN: Learning Trustworthiness on Edge Signs for Effective Signed Graph Convolutional Networks
- Authors
- Kim, Min-Jeong; Lee, Yeon-Chang; Kim, Sang-Wook
- Issue Date
- Jul-2023
- Publisher
- Association for Computing Machinery, Inc
- Keywords
- signed networks; trustworthy graph convolutional networks
- Citation
- SIGIR 2023 - Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp 2451 - 2455
- Pages
- 5
- Indexed
- SCOPUS
- Journal Title
- SIGIR 2023 - Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval
- Start Page
- 2451
- End Page
- 2455
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/192949
- DOI
- 10.1145/3539618.3592075
- Abstract
- The problem of signed network embedding (SNE) aims to represent nodes in a given signed network as low-dimensional vectors. While several SNE methods based on graph convolutional networks (GCN) have been proposed, we point out that they significantly rely on the assumption that the decades-old balance theory always holds in the real world. To address this limitation, we propose a novel GCN-based SNE approach, named as TrustSGCN, which measures the trustworthiness on edge signs for high-order relationships inferred by balance theory and corrects incorrect embedding propagation based on the trustworthiness. The experiments on four real-world signed network datasets demonstrate that TrustSGCN consistently outperforms five state-of-the-art GCN-based SNE methods. The code is available at https://github.com/kmj0792/TrustSGCN.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.