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

Leveraging Attribute Interaction and Self-Training for Graph Alignment via Optimal Transport

Author

Listed:
  • Songyang Chen

    (School of Computer Science and Technology, Beijing Jiaotong University, Beijing 100044, China)

  • Youfang Lin

    (School of Computer Science and Technology, Beijing Jiaotong University, Beijing 100044, China)

  • Ziyuan Zeng

    (School of Computer Science and Technology, Beijing Jiaotong University, Beijing 100044, China)

  • Mengyang Xue

    (School of Computer Science and Technology, Beijing Jiaotong University, Beijing 100044, China)

Abstract

Unsupervised alignment of two attributed graphs finds the node correspondence between them without any known anchor links. The recently proposed optimal transport (OT)-based approaches tackle this problem via Gromov–Wasserstein distance and joint learning of graph structures and node attributes, which achieve better accuracy and stability compared to previous embedding-based methods. However, it remains largely unexplored under the OT framework to fully utilize both structure and attribute information. We propose an Optimal Transport-based Graph Alignment method with Attribute Interaction and Self-Training ( PORTRAIT ), with the following two contributions. First, we enable the interaction of different dimensions of node attributes in the Gromov–Wasserstein learning process, while simultaneously integrating multi-layer graph structural information and node embeddings into the design of the intra-graph cost, which yields more expressive power with theoretical guarantee. Second, the self-training strategy is integrated into the OT-based learning process to significantly enhance node alignment accuracy with the help of confident predictions. Extensive experimental results validate the efficacy of the proposed model.

Suggested Citation

  • Songyang Chen & Youfang Lin & Ziyuan Zeng & Mengyang Xue, 2025. "Leveraging Attribute Interaction and Self-Training for Graph Alignment via Optimal Transport," Mathematics, MDPI, vol. 13(12), pages 1-23, June.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:12:p:1971-:d:1679353
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/12/1971/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/12/1971/
    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:13:y:2025:i:12:p:1971-:d:1679353. 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.