Browse State-of-the-Art › Dynamic graph embedding
Dynamic graph embedding
10 papers with code · 0 benchmarks · 0 datasets 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
1 subtask in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
10 shown of 10 papers with code (24 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.
-
19 Jun 2024 1 repository listedWe first identify biased structural evolutions in a dynamic graph based on the evolving trend of vertex degree and then propose FairDGE, the first structurally Fair Dynamic Graph Embedding algorithm.
-
17 Jun 2024 1 repository listed Syntology ran 0 of 1 samples · 1 unverified · 1 pointer-only (licence)Moreover, we conduct extensive benchmark experiments on DTGB, evaluating 7 popular dynamic graph learning algorithms and their variants of adapting to text attributes with LLM embeddings, along with 6 powerful large…
-
29 May 2024 1 repository listed Syntology ran 6 of 12 samples · 6 unverified · 12 pointer-only (licence)In this work we propose to use a dynamic graph representation known in the tensor literature as the unfolding, to achieve valid prediction sets via conformal prediction.
-
5 Jul 2023 1 repository listedHence, incorporating long-range dependencies from the historical graph context plays a crucial role in accurately learning their temporal dynamics.
-
15 Oct 2022 1 repository listed Syntology ran 3 of 5 samples · 2 unverified · 5 pointer-only (licence)Dynamic interaction graphs have been widely adopted to model the evolution of user-item interactions over time.
-
28 Sep 2021 1 repository listedHowever, recent advances mostly focus on learning node embeddings as deterministic "vectors" for static graphs yet disregarding the key graph temporal dynamics and the evolving uncertainties associated with node…
-
27 Feb 2021 1 repository listedAs a matter of fact, this smoothing technique can not only encourage must-link node pairs to get closer but also push cannot-link pairs to shrink together, which potentially cause serious feature shrink or oversmoothing…
-
22 Mar 2020 1 repository listedGraph representation learning is a fundamental task in various applications that strives to learn low-dimensional embeddings for nodes that can preserve graph topology information.
-
6 Apr 2019 1 repository listedExperimental results on several downstream tasks, over seven real-world data sets, show that FILDNE is able to reduce memory and computational time costs while providing competitive quality measure gains with respect to…
-
26 Nov 2018 1 repository listedDynamicGEM is an open-source Python library for learning node representations of dynamic graphs.
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