source code for signed graph attention networks (ICANN2019) & SDGNN (AAAI2021)
-
Updated
Jul 6, 2023 - Python
source code for signed graph attention networks (ICANN2019) & SDGNN (AAAI2021)
source code for signed bipartite graph neural networks(CIKM 2021)
[WebConf 2020] Searching for polarization in signed graphs: a local spectral approach
The algorithm based on the UBQP model (Aref et al. 2018) for computing the exact value of frustration index (also called line index of balance)
The algorithms for multilevel evaluation of balance in signed directed networks
A library-agnostic project for calculating exactly and efficiently social balance, based on the Aref, Mason and Wilson paper (https://arxiv.org/abs/1611.09030)
The algorithm based on the XOR model (Aref et al. 2019) for computing the exact value of frustration index (also called line index of balance)
CTMS (Closed Triple Micro Structure) is a project based on SNAP (Stanford Network Analysis Platform) that improves the effectiveness of sign prediction in the signed networks like Epinions:
Extraction and analysis of a Trajan-related social network
Add a description, image, and links to the signed-graph topic page so that developers can more easily learn about it.
To associate your repository with the signed-graph topic, visit your repo's landing page and select "manage topics."