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
Papers archive 2025-07-28
archive papers tagged: 24 · with a code link: 10 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 24 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 24 of 24, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
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 official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample) · 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 official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified (of 12 harvested samples) · 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 official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified (of 5 harvested samples) · 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.
-
A Comparative Study on Dynamic Graph Embedding based on Mamba and Transformers15 Dec 2024 0 repositories listedDynamic graph embedding has emerged as an important technique for modeling complex time-evolving networks across diverse domains.
-
Non-Progressive Influence Maximization in Dynamic Social Networks10 Dec 2024 0 repositories listedThe influence maximization (IM) problem involves identifying a set of key individuals in a social network who can maximize the spread of influence through their network connections.
-
Local Intrinsic Dimensionality for Dynamic Graph Embeddings25 Nov 2024 0 repositories listedThe notion of local intrinsic dimensionality (LID) has important theoretical implications and practical applications in the fields of data mining and machine learning.
-
Empowering Interdisciplinary Insights with Dynamic Graph Embedding Trajectories25 Jun 2024 0 repositories listedOur work not only addresses the ongoing challenges in visualizing and analyzing DTDG models but also establishes a foundational framework for future investigations into dynamic graph representation and analysis across…
-
DySuse: Susceptibility Estimation in Dynamic Social Networks21 Aug 2023 0 repositories listedInfluence estimation aims to predict the total influence spread in social networks and has received surged attention in recent years.
-
ATEM: A Topic Evolution Model for the Detection of Emerging Topics in Scientific Archives4 Jun 2023 0 repositories listedThis paper presents ATEM, a novel framework for studying topic evolution in scientific archives.
-
Time-aware Dynamic Graph Embedding for Asynchronous Structural Evolution1 Jul 2022 0 repositories listedDynamic graphs refer to graphs whose structure dynamically changes over time.
-
WalkingTime: Dynamic Graph Embedding Using Temporal-Topological Flows22 Nov 2021 0 repositories listedIncreased attention has been paid over the last four years to dynamic network embedding.
-
Data-driven Smart Ponzi Scheme Detection20 Aug 2021 0 repositories listedA smart Ponzi scheme is a new form of economic crime that uses Ethereum smart contract account and cryptocurrency to implement Ponzi scheme.
-
DyGCN: Dynamic Graph Embedding with Graph Convolutional Network7 Apr 2021 0 repositories listedGraph embedding, aiming to learn low-dimensional representations (aka. embeddings) of nodes, has received significant attention recently.
-
A Survey on Embedding Dynamic Graphs4 Jan 2021 0 repositories listedEmbedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization.
-
Understanding graph embedding methods and their applications15 Dec 2020 0 repositories listedGraph analytics can lead to better quantitative understanding and control of complex networks, but traditional methods suffer from high computational cost and excessive memory requirements associated with the…
-
Dynamic Graph Embedding via LSTM History Tracking5 Nov 2019 0 repositories listedMany real world networks are very large and constantly change over time.
-
Learning event representations for temporal segmentation of image sequences by dynamic graph embedding8 Oct 2019 0 repositories listedRecently, self-supervised learning has proved to be effective to learn representations of events suitable for temporal segmentation in image sequences, where events are understood as sets of temporally adjacent images…
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; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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