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.
Signed networks allow to model positive and negative relationships. We analyze existing extensions of spectral clustering to signed networks. It turns out that existing approaches do not recover the ground truth clustering in several situations where either the positive or the negative network structures contain no noise. Our analysis shows that these problems arise as existing approaches take some form of arithmetic mean of the Laplacians of the positive and negative part. As a solution we propose to use the geometric mean of the Laplacians of positive and negative part and show that it outperforms the existing approaches. While the geometric mean of matrices is computationally expensive, we show that eigenvectors of the geometric mean can be computed efficiently, leading to a numerical scheme for sparse matrices which is of independent interest.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1701.00757")
get_code_for_paper("1701.00757")
have("1701.00757")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1701.00757.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1701.00757)
Connect an agent — have() is free.