arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.04725cs.SIcs.LG

CONE-Align: Consistent Network Alignment with Proximity-Preserving Node Embedding

University of Michigan, Ann Arbor(密歇根大学安娜堡分校)

Xiyuan Chen, Mark Heimann, Fatemeh Vahedian, Danai Koutra

英文摘要:

Network alignment, the process of finding correspondences between nodes in different graphs, has many scientific and industrial applications. Existing unsupervised network alignment methods find suboptimal alignments that break up node neighborhoods, i.e. do not preserve matched neighborhood consistency. To improve this, we propose CONE-Align, which models intra-network proximity with node embeddings and uses them to match nodes across networks after aligning the embedding subspaces. Experiments on diverse, challenging datasets show that CONE-Align is robust and obtains 19.25% greater accuracy on average than the best-performing state-of-the-art graph alignment algorithm in highly noisy settings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑