Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Piriyasatit, Suchanuch, Yuan, Chaohao, Kuruoglu, Ercan Engin
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912293518835712
author Piriyasatit, Suchanuch
Yuan, Chaohao
Kuruoglu, Ercan Engin
author_facet Piriyasatit, Suchanuch
Yuan, Chaohao
Kuruoglu, Ercan Engin
contents Dynamic network embedding methods transform nodes in a dynamic network into low-dimensional vectors while preserving network characteristics, facilitating tasks such as node classification and community detection. Several embedding methods have been proposed to capture structural proximity among nodes in a network, where densely connected communities are preserved, while others have been proposed to preserve structural equivalence among nodes, capturing their structural roles regardless of their relative distance in the network. However, most existing methods that aim to preserve both network characteristics mainly focus on static networks and those designed for dynamic networks do not explicitly account for inter-snapshot structural properties. This paper proposes a novel unifying dynamic network embedding method that simultaneously preserves both structural proximity and equivalence while considering inter-snapshot structural relationships in a dynamic network. Specifically, to define structural equivalence in a dynamic network, we use temporal subgraphs, known as dynamic graphlets, to capture how a node's neighborhood structure evolves over time. We then introduce a temporal-structural random walk to flexibly sample time-respecting sequences of nodes, considering both their temporal proximity and similarity in evolving structures. The proposed method is evaluated using five real-world networks on node classification where it outperforms benchmark methods, showing its effectiveness and flexibility in capturing various aspects of a network.
format Preprint
id arxiv_https___arxiv_org_abs_2503_19926
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding
Piriyasatit, Suchanuch
Yuan, Chaohao
Kuruoglu, Ercan Engin
Social and Information Networks
Machine Learning
Dynamic network embedding methods transform nodes in a dynamic network into low-dimensional vectors while preserving network characteristics, facilitating tasks such as node classification and community detection. Several embedding methods have been proposed to capture structural proximity among nodes in a network, where densely connected communities are preserved, while others have been proposed to preserve structural equivalence among nodes, capturing their structural roles regardless of their relative distance in the network. However, most existing methods that aim to preserve both network characteristics mainly focus on static networks and those designed for dynamic networks do not explicitly account for inter-snapshot structural properties. This paper proposes a novel unifying dynamic network embedding method that simultaneously preserves both structural proximity and equivalence while considering inter-snapshot structural relationships in a dynamic network. Specifically, to define structural equivalence in a dynamic network, we use temporal subgraphs, known as dynamic graphlets, to capture how a node's neighborhood structure evolves over time. We then introduce a temporal-structural random walk to flexibly sample time-respecting sequences of nodes, considering both their temporal proximity and similarity in evolving structures. The proposed method is evaluated using five real-world networks on node classification where it outperforms benchmark methods, showing its effectiveness and flexibility in capturing various aspects of a network.
title Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding
topic Social and Information Networks
Machine Learning
url https://arxiv.org/abs/2503.19926