Consistent Network Alignment with Node Embedding release_k5eq4qryevfg7conz6pgdh4mii

by Xiyuan Chen, Mark Heimann, Fatemeh Vahedian, Danai Koutra

Released as a article .

2020  

Abstract

Network alignment, the process of finding correspondences between nodes in different graphs, has significant scientific and industrial applications. We find that many existing network alignment methods fail to achieve accurate alignments because they break up node neighborhoods during alignment, failing to preserve matched neighborhood consistency. To improve this, we propose CONE-Align, which matches nodes based on embeddings that model intra-network proximity and are aligned to be comparable across networks. Experiments on diverse, challenging datasets show that CONE-Align is robust and obtains up to 49% greater accuracy than the state-of-the-art graph alignment algorithms.
In text/plain format

Archived Files and Locations

application/pdf  1.0 MB
file_pmlr2toi7jh2jm3h7dk4x7i7eq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-05-10
Version   v1
Language   en ?
arXiv  2005.04725v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 04c5bff7-18e4-4270-adb3-9feff9194261
API URL: JSON