IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i3p573-d1043279.html
   My bibliography  Save this article

An Unsupervised Rapid Network Alignment Framework via Network Coarsening

Author

Listed:
  • Lei Zhang

    (School of Mathematics and Computer Science, Tongling University, Tongling 244061, China)

  • Feng Qian

    (School of Mathematics and Computer Science, Tongling University, Tongling 244061, China
    School of Computer Science and Technology, Anhui University, Hefei 230601, China)

  • Jie Chen

    (School of Computer Science and Technology, Anhui University, Hefei 230601, China)

  • Shu Zhao

    (School of Computer Science and Technology, Anhui University, Hefei 230601, China)

Abstract

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.

Suggested Citation

  • Lei Zhang & Feng Qian & Jie Chen & Shu Zhao, 2023. "An Unsupervised Rapid Network Alignment Framework via Network Coarsening," Mathematics, MDPI, vol. 11(3), pages 1-16, January.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:3:p:573-:d:1043279
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/3/573/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/3/573/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:3:p:573-:d:1043279. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.