Pith. sign in

REVIEW 2 cited by

Dynamic Node Embeddings from Edge Streams

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.06449 v2 pith:M3WG5V24 submitted 2019-04-12 cs.LG cs.AIcs.SIstat.ML

Dynamic Node Embeddings from Edge Streams

classification cs.LG cs.AIcs.SIstat.ML
keywords temporalembeddingsdynamicnetworkwalksctdnesgraphsinformation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Such temporal networks (or edge streams) consist of a sequence of timestamped edges and are seemingly ubiquitous. Despite the importance of accurately modeling the temporal information, most embedding methods ignore it entirely or approximate the temporal network using a sequence of static snapshot graphs. In this work, we propose using the notion of temporal walks for learning dynamic embeddings from temporal networks. Temporal walks capture the temporally valid interactions (e.g., flow of information, spread of disease) in the dynamic network in a lossless fashion. Based on the notion of temporal walks, we describe a general class of embeddings called continuous-time dynamic network embeddings (CTDNEs) that completely avoid the issues and problems that arise when approximating the temporal network as a sequence of static snapshot graphs. Unlike previous work, CTDNEs learn dynamic node embeddings directly from the temporal network at the finest temporal granularity and thus use only temporally valid information. As such CTDNEs naturally support online learning of the node embeddings in a streaming real-time fashion. Finally, the experiments demonstrate the effectiveness of this class of embedding methods that leverage temporal walks as it achieves an average gain in AUC of 11.9% across all methods and graphs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Representing Higher-Order Networks: A Survey of Graph-Based Frameworks

    cs.SI 2026-03 unverdicted novelty 4.0

    A comprehensive survey of graph-based frameworks for higher-order networks, covering foundational concepts, extensions, and newly introduced formalisms with emphasis on structural principles and applications.

  2. Representing Higher-Order Networks: A Survey of Graph-Based Frameworks

    cs.SI 2026-03 unverdicted novelty 2.0

    A comprehensive survey of graph-based formalisms for higher-order networks including multiway, hierarchical, temporal, multilayer, recursive, and tensor-based models.