Distributional Learning for Network Alignment with Global Constraints

doi:10.1145/3638056

Distributional Learning for Network Alignment with Global Constraints

2024-02-12

1

OA

AI

DOI：10.1145/3638056

Original request for help

Save

Abstract

En 中文

Network alignment, pairing corresponding nodes across the source and target networks, plays an important role in many data mining tasks. Extensive studies focus on learning node embeddings across different networks in a unified space. However, these methods have not taken the large structural discrepancy between aligned nodes into account and, thus, are largely confined by the deterministic representations of nodes. In this work, we propose a novel network alignment framework highlighted by distributional learning and globally optimal alignment. By modeling the uncertainty of each node by Gaussian distribution, our framework builds similarity matrices on the Wasserstein distance between distributions and applies Sinkhorn operation, which learns the globally optimal mapping in an end-to-end fashion. We show that each integrated part of the framework contributes to the overall performance. Under a variety of experimental settings, our alignment framework shows superior accuracy and efficiency to the state-of-the-art.

Keywords:

Network alignment

distributional learning

Distributional Learning for Network Alignment with Global Constraints

Abstract

Journal

Organization