The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Signed Graph Convolutional Networks
Abstract
Due to the fact much of today's data can be represented as graphs, there has been a demand for generalizing neural network models for graph data. One recent direction that has shown fruitful results, and therefore growing interest, is the usage of graph convolutional neural networks (GCNs). They have been shown to provide a significant improvement on a wide range of tasks in network analysis, one of which being node representation learning. The task of learning low-dimensional node representations has shown to increase performance on a plethora of other tasks from link prediction and node classification, to community detection and visualization. Simultaneously, signed networks (or graphs having both positive and negative links) have become ubiquitous with the growing popularity of social media. However, since previous GCN models have primarily focused on unsigned networks (or graphs consisting of only positive links), it is unclear how they could be applied to signed networks due to the challenges presented by negative links. The primary challenges are based on negative links having not only a different semantic meaning as compared to positive links, but their principles are inherently different and they form complex relations with positive links. Therefore we propose a dedicated and principled effort that utilizes balance theory to correctly aggregate and propagate the information across layers of a signed GCN model. We perform empirical experiments comparing our proposed signed GCN against state-of-the-art baselines for learning node representations in signed networks. More specifically, our experiments are performed on four real-world datasets for the classical link sign prediction problem that is commonly used as the benchmark for signed network embeddings algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Semi-supervised classification with graph convolutional networks
Kipf, T. N., & Welling, M. (2016) · arXiv · doi:10.48550/arxiv.1609.02907 · Cited by 24,853
Birds of a Feather: Homophily in Social Networks
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001) · Annual Review of Sociology · doi:10.1146/annurev.soc.27.1.415 · Cited by 18,567
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
Modeling Relational Data with Graph Convolutional Networks
Schlichtkrull, M., Kipf, T. N., Bloem, P., van den Berg, R., Titov, I., & Welling, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93417-4_38 · Cited by 5,570
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
Silva, G., Rodrigues, M., Teixeira, A., & Amorim, M. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2024.20 · Cited by 5,183
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Spectral Networks and Locally Connected Networks on Graphs
Bruna, J., Zaremba, W., Szlam, A., & LeCun, Y. (2013) · arXiv · doi:10.48550/arxiv.1312.6203 · Cited by 3,983
Attitudes and cognitive organization
Heider, F. (1946) · The Journal of Psychology · doi:10.1080/00223980.1946.9917275 · Cited by 3,672
Structural balance: a generalization of Heider's theory.
Cartwright, D., & Harary, F. (1956) · Psychological Review · doi:10.1037/h0046049 · Cited by 2,525
Predicting positive and negative links in online social networks
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772756 · Cited by 1,470
Signed networks in social media
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753532 · Cited by 1,306
Community Preserving Network Embedding
Wang, X., Cui, P., Wang, J., Pei, J., Zhu, W., & Yang, S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10488 · Cited by 883
The Slashdot Zoo: Mining a Social Network with Negative Edges
Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2017) · arXiv (Cornell University) · doi:10.24406/publica-r-363202 · Cited by 384
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., De Luca, E. W., & Albayrak, S. (2010) · Proceedings of the 2010 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.49 · Cited by 369
A Survey of Signed Network Mining in Social Media
Tang, J., Chang, Y., Aggarwal, C., & Liu, H. (2017) · ACM Computing Surveys · doi:10.1145/2956185 · Cited by 342
Self-citationThe slashdot zoo: mining a social network with negative edges
Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526809 · Cited by 342
SHINE: Signed Heterogeneous Information Network Embedding for Sentiment Link Prediction
Wang, H., Zhang, F., Hou, M., Xie, X., Guo, M., & Liu, Q. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159666 · Cited by 334
Signed Network Embedding in Social Media
Wang, S., Tang, J., Aggarwal, C., Chang, Y., & Liu, H. (2017) · Proceedings of the 2017 SIAM International Conference on Data Mining · doi:10.1137/1.9781611974973.37 · Cited by 236
Self-citationYuan, S., Wu, X., & Xiang, Y. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-57529-2_15 · Cited by 176
SIDE: Representation Learning in Signed Directed Networks
Kim, J. H., Park, H., Lee, J., & Kang, U. (2018) · International World Wide Web Conference (WWW) · doi:10.1145/3178876.3186117 · Cited by 175
Attributed Signed Network Embedding
Wang, S., Aggarwal, C. C., Tang, J., & Liu, H. (2017) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3132847.3132905 · Cited by 125
Self-citationLinked Document Embedding for Classification
Wang, S., Tang, J., Aggarwal, C. C., & Liu, H. (2016) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2983323.2983755 · Cited by 95
Self-citationIs distrust the negation of trust?: the value of distrust in social media
Tang, J., Hu, X., & Liu, H. (2014) · Proceedings of the 25th ACM conference on Hypertext and social media · doi:10.1145/2631775.2631793 · Cited by 91
Self-citationScalable clustering of signed networks using balance normalized cut
Chiang, K.-Y., Whang, J. J., & Dhillon, I. S. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396841 · Cited by 83
Signed Network Modeling Based on Structural Balance Theory
Derr, T., Aggarwal, C. C., & Tang, J. (2018) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3269206.3271746 · Cited by 65
Self-citationChen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
Deep Learning on Graphs: A Survey
Zhang, Z., Cui, P., & Zhu, W. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2981333 · Cited by 1,633
Fast Graph Representation Learning with PyTorch Geometric
Fey, M., & Lenssen, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02428 · Cited by 1,132
A Review of Graph Neural Networks and Their Applications in Power Systems
Liao, W., Bak-Jensen, B., Radhakrishna Pillai, J., Wang, Y., & Wang, Y. (2022) · Journal of Modern Power Systems and Clean Energy · doi:10.35833/mpce.2021.000058 · Cited by 426
Metadata
- Authors
- Derr, T., Ma, Y., & Tang, J.
- Venue
- 2018 IEEE International Conference on Data Mining (ICDM)
- Publisher
- IEEE
- Published
- 2018-11
- Pages
- 929-934
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2887092413
- Cited by
- 314
- References
- 28
- FWCI
- 10.82
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.