MINING: Multi-Granularity Network Alignment Based on Contrastive Learning

Network alignment aims to discover nodes in different networks belonging to the same identity. In recent years, the network alignment problem has aroused significant attentions in both industry and academia. However, the continuous exploding of network data brings two challenges in solving the network alignment problem, i.e., large network scale and scarce labeled data. To bridge this gap, in this paper we propose a novel approach termed as
M
ulti-granular
I
ty
N
etwork al
I
gnment based on co
N
trastive learnin
G
(MINING). Specifically, in MINING, we first design multi-granularity alignment framework to solve the issue of large network scale. Then, we design intra- and inter-network contrastive learning to solve the issue of scarce labeled data. Moreover, we provide theoretical proofs to demonstrate the effectiveness of MINING. Finally, we conduct extensive experiments on the benchmark datasets of Facebook-Twitter, AMiner-LinkedIn and DBpedia
$_{\text{ZH}}$
-DBpedia
$_{\text{EN}}$
, and results show that MINING can averagely achieve 15.93% higher
$\operatorname{Hits@}k$
and 14.82% higher
$\operatorname{MRR@}k$
compared with the state-of-the-art methods.