改进网络对齐以提高匹配邻域一致性
Refining Network Alignment to Improve Matched Neighborhood Consistency
摘要:
网络对齐,或在不同图中的节点之间找到有意义的节点对应关系的任务,是具有许多科学和工业应用的重要图挖掘任务。网络对齐的一个重要原则是匹配邻域一致性(MNC):一个图中接近的节点应该与另一个图中接近的节点匹配。我们从理论上证明了MNC和对准精度之间的密切关系。由于许多现有的网络对齐方法难以在困难的情况下保持拓扑一致性,我们展示了如何通过改进MNC来改进它们的解决方案。我们的改进方法,RefiNA,是直接实现,承认可扩展的稀疏近似,并可以配对后的任何网络对齐方法。大量的实验表明,RefiNA将各种无监督网络对齐方法的准确性提高了90%,使它们足够强大,可以对齐比先前工作中考虑的拓扑差异高5倍的图形。
英文摘要:
Network alignment, or the task of finding meaningful node correspondences between nodes in different graphs, is an important graph mining task with many scientific and industrial applications. An important principle for network alignment is matched neighborhood consistency (MNC): nodes that are close in one graph should be matched to nodes that are close in the other graph. We theoretically demonstrate a close relationship between MNC and alignment accuracy. As many existing network alignment methods struggle to preserve topological consistency in difficult scenarios, we show how to refine their solutions by improving their MNC. Our refinement method, RefiNA, is straightforward to implement, admits scalable sparse approximation, and can be paired post hoc with any network alignment method. Extensive experiments show that RefiNA increases the accuracy of diverse unsupervised network alignment methods by up to 90%, making them robust enough to align graphs that are 5x more topologically different than were considered in prior work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。