Browse State-of-the-Art › Dynamic Node Classification
Dynamic Node Classification
5 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
node classification on temporal graphs
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
5 shown of 5 papers with code (10 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
23 Mar 2023 2 repositories listed Syntology ran 1 of 3 samples · 2 unverifiedWe propose DyGFormer, a new Transformer-based architecture for dynamic graph learning.
-
30 Oct 2022 2 repositories listedTemporal graph neural networks have shown promising results in learning inductive representations by automatically extracting temporal patterns.
-
6 Nov 2024 1 repository listed Syntology ran 1 of 2 samples · 1 unverified · 2 pointer-only (licence)Despite the successful application of Temporal Graph Networks (TGNs) for tasks such as dynamic node classification and link prediction, they still perform poorly on the task of dynamic node affinity prediction -- where…
-
18 May 2023 1 repository listedWe approach the problem by our proposed STEP, a self-supervised temporal pruning framework that learns to remove potentially redundant edges from input dynamic graphs.
-
22 Mar 2023 1 repository listed Syntology ran 0 of 8 samples · 8 unverifiedDynamic graphs arise in various real-world applications, and it is often welcomed to model the dynamics directly in continuous time domain for its flexibility.
Syntology lines on 3 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections