Cross-Graph Embedding With Trainable Proximity for Graph Alignment
Wei Tang, Haifeng Sun, Jingyu Wang, Qi Qi, Huangxun Chen, Li Chen
Abstract
Graph alignment, also known as network alignment, has many applications in data mining tasks. It aims to find the node correspondence across disjoint graphs. With recent representation learning advancements, embedding-based graph alignment has become a hot topic. Existing embedding-based methods focus either on structural proximity across graphs or on the positional proximity within a single graph. However, only considering the structural similarity will make the position relation of nodes not clear enough, which makes it easy to misalign the nodes close in distance, while only considering the position proximity of a single graph will make the node embeddings from different graphs in different subspaces. To mitigate this issue, we propose a novel model CEGA for <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">C</b> ross-graph <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">E</b> mbedding-based <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">G</b> raph <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</b> lignment, which can generate node embeddings to reflect structural proximity and positional proximity simultaneously. Meanwhile, we make the proximity trainable thus it can be learned to best suit the alignment task at hand automatically. We show that CEGA outperforms existing graph alignment methods in accuracy under unsupervised scenarios through extensive experiments on public benchmarks.