Kyle K. Qin, Flora D. Salim, Yongli Ren, Wei Shao, Mark Heimann...
TL;DR本文提出了一种名为G-CREWE（Graph CompREssion With Embedding）的框架，可以通过节点嵌入来解决网络对齐问题，并且采用MERGE压缩机制以提高效率和精度。实验表明，该方法比现有竞争方法快两倍以上，同时保持高准确性。
Abstract
network alignment is useful for multiple applications that require increasingly large graphs to be processed. Existing research approaches this as an optimization problem or computes the similarity based on node representations. However, the process of aligning every pair of nodes betw