3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in link-sign-prediction-2
Use these libraries to find link-sign-prediction-2 models and implementations
No subtasks available.
Extensive experimental results in real-world datasets demonstrate the superiority of the proposed model over the state-of-the-art network embedding algorithms for graph representation learning in signed networks.
This work proposes an inference mechanism for fitting a generative, agent-like model of opinion dynamics to real-world social traces, and designs an inference algorithm that can recover the latent opinion trajectories from traces generated by the classical agent-based model.
The representation learning problem on signed directed networks is reformulated from a variational auto-encoding perspective and a decoupled variational embedding (DVE) method is developed that leverages a specially designed auto- Encoding structure to capture both the first-order and high-order topology of signed directed Networks, and thus learns more representative node embeddings.
A novel Signed Bipartite Graph Neural Networks (SBGNNs) is proposed to learn node embeddings for signed bipartite networks and some comprehensive analysis of balance theory from two perspectives on several real-world datasets are done.
A novel probabilistic balanced normalized cut loss for training nodes in a GNN framework for semi-supervised signed network clustering, called SSSNET, which has node clustering as main focus, with an emphasis on polarization effects arising in networks.
Adding a benchmark result helps the community track progress.