Amitoz Azad
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.
Node classification on graphs can be formulated as the Dirichlet problem on graphs where the signal is given at the labeled nodes, and the harmonic extension is done on the unlabeled nodes. This paper considers a time-dependent version of the Dirichlet problem on graphs and shows how to improve its solution by learning the proper initialization vector on the unlabeled nodes. Further, we show that the improved solution is at par with state-of-the-art methods used for node classification. Finally, we conclude this paper by discussing the importance of parameter t, pros, and future directions.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.01358")
get_code_for_paper("2205.01358")
have("2205.01358")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2205.01358.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2205.01358)
Connect an agent — have() is free.