Network alignment (NA) is the task of discovering node correspondences across multiple networks. Although NA methods have achieved remarkable success in a myriad of scenarios, their effectiveness is not without additional information such as prior anchor links and/or node features, which may not always be available due to privacy concerns or access restrictions. To tackle this challenge, we propose Grad-Align+, a novel NA method built upon a recent state-of-the-art NA method, the so-called Grad-Align, that gradually discovers a part of node pairs until all node pairs are found. In designing Grad-Align+, we account for how to augment node features in the sense of performing the NA task and how to design our NA method by maximally exploiting the augmented node features. To achieve this goal, Grad-Align+ consists of three key components: 1) centrality-based node feature augmentation, 2) graph neural network-aided embedding similarity calculation alongside the augmented node features, and 3) gradual NA with similarity calculation using aligned cross-network neighbor-pairs (ACNs). Through comprehensive experiments, we demonstrate that Grad-Align+ exhibits (a) the superiority over benchmark NA methods, (b) empirical validations as well as our theoretical findings to see the effectiveness of CNFA, (c) the influence of each component, (d) the robustness to network noises, and (e) the computational efficiency.

翻译：网络对齐(NA)是在多个网络中寻找节点对应关系的任务。尽管NA方法已在众多场景中取得显著成功，但其有效性离不开额外信息（如先验锚链接和/或节点特征），而这些信息可能因隐私问题或访问限制而无法获取。为应对这一挑战，我们提出Grad-Align+，一种基于最新最先进的NA方法（即Grad-Align）的新型NA方法，该方法逐步发现部分节点对，直至所有节点对都被找到。在设计Grad-Align+时，我们考虑了如何在执行NA任务的意义上增强节点特征，以及如何通过最大化利用增强后的节点特征来设计我们的NA方法。为实现这一目标，Grad-Align+包含三个关键组件：1)基于中心性的节点特征增强，2)结合增强节点特征的图神经网络辅助嵌入相似度计算，3)利用对齐的跨网络邻居对(ACNs)进行相似度计算的渐进式NA。通过全面实验，我们证明Grad-Align+展现出：(a)优于基准NA方法的性能，(b)实证验证及理论发现以验证CNFA的有效性，(c)各组件的影响，(d)对网络噪声的鲁棒性，以及(e)计算效率。