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.
We show that a modification of the first layer of a Graph Convolutional Network (GCN) can be used to effectively propagate label information across neighbor nodes, for binary and multi-class classification problems. This is done by selectively eliminating self-loops for the label features during the training phase of a GCN. The GCN architecture is otherwise unchanged, without any extra hyper-parameters, and can be used in both a transductive and inductive setting. We show through several experiments that, depending on how many labels are available during the inference phase, this strategy can lead to a substantial improvement in the model performance compared to a standard GCN approach, including with imbalanced datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.02153")
get_code_for_paper("2104.02153")
have("2104.02153")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.02153.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.02153)
Connect an agent — have() is free.