We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Relational data are usually highly incomplete in practice, which inspires us to leverage side information to improve the performance of community detection and link prediction. This paper presents a Bayesian probabilistic approach that incorporates various kinds of node attributes encoded in binary form in relational models with Poisson likelihood. Our method works flexibly with both directed and undirected relational networks. The inference can be done by efficient Gibbs sampling which leverages sparsity of both networks and node attributes. Extensive experiments show that our models achieve the state-of-the-art link prediction results, especially with highly incomplete relational data.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1706.04289")
get_code_for_paper("1706.04289")
have("1706.04289")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1706.04289.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1706.04289)
Connect an agent — have() is free.