LGSIMLAug 24, 2018

GoT-WAVE: Temporal network alignment using graphlet-orbit transitions

arXiv:1808.08195v12 citations
Originality Incremental advance
AI Analysis

This work addresses the need for efficient and accurate global pairwise alignment of temporal networks, which is incremental as it builds upon existing methods like DynaWAVE.

The paper tackles the problem of aligning temporal networks by introducing a new dynamic node conservation measure based on graphlet-orbit transitions, integrated into the DynaWAVE algorithm to create GoT-WAVE, resulting in a 25% accuracy improvement and 64% speed increase on synthetic networks.

Global pairwise network alignment (GPNA) aims to find a one-to-one node mapping between two networks that identifies conserved network regions. GPNA algorithms optimize node conservation (NC) and edge conservation (EC). NC quantifies topological similarity between nodes. Graphlet-based degree vectors (GDVs) are a state-of-the-art topological NC measure. Dynamic GDVs (DGDVs) were used as a dynamic NC measure within the first-ever algorithms for GPNA of temporal networks: DynaMAGNA++ and DynaWAVE. The latter is superior for larger networks. We recently developed a different graphlet-based measure of temporal node similarity, graphlet-orbit transitions (GoTs). Here, we use GoTs instead of DGDVs as a new dynamic NC measure within DynaWAVE, resulting in a new approach, GoT-WAVE. On synthetic networks, GoT-WAVE improves DynaWAVE's accuracy by 25% and speed by 64%. On real networks, when optimizing only dynamic NC, each method is superior ~50% of the time. While DynaWAVE benefits more from also optimizing dynamic EC, only GoT-WAVE can support directed edges. Hence, GoT-WAVE is a promising new temporal GPNA algorithm, which efficiently optimizes dynamic NC. Future work on better incorporating dynamic EC may yield further improvements.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes