4.7 Article

An Unsupervised Rapid Network Alignment Framework via Network Coarsening

Journal

MATHEMATICS
Volume 11, Issue 3, Pages -

Publisher

MDPI
DOI: 10.3390/math11030573

Keywords

network representation learning; network alignment; graph neural network; network coarsening; multi-level embedding

Categories

Ask authors/readers for more resources

Network alignment aims to identify the correspondence of nodes between two or more networks, and it is the cornerstone of many network mining tasks. We propose the URNA framework based on graph neural network, which achieves an effective balance between accuracy and efficiency through model training and network alignment phases. Experimental results show that the proposed method can significantly reduce running time and memory requirements while guaranteeing alignment performance.
Network alignment aims to identify the correspondence of nodes between two or more networks. It is the cornerstone of many network mining tasks, such as cross-platform recommendation and cross-network data aggregation. Recently, with the development of network representation learning techniques, researchers have proposed many embedding-based network alignment methods. The effect is better than traditional methods. However, several issues and challenges remain for network alignment tasks, such as lack of labeled data, mapping across network embedding spaces, and computational efficiency. Based on the graph neural network (GNN), we propose the URNA (unsupervised rapid network alignment) framework to achieve an effective balance between accuracy and efficiency. There are two phases: model training and network alignment. We exploit coarse networks to accelerate the training of GNN after first compressing the original networks into small networks. We also use parameter sharing to guarantee the consistency of embedding spaces and an unsupervised loss function to update the parameters. In the network alignment phase, we first use a once-pass forward propagation to learn node embeddings of original networks, and then we use multi-order embeddings from the outputs of all convolutional layers to calculate the similarity of nodes between the two networks via vector inner product for alignment. Experimental results on real-world datasets show that the proposed method can significantly reduce running time and memory requirements while guaranteeing alignment performance.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available