Improving Unsupervised Network Alignment with Matched Neighborhood Consistency

Yan Li, Lei Zhang and Feng Qian ()
Additional contact information
Yan Li: School of Mathematics and Computer Science, Tongling University, Tongling 244061, China
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

Mathematics, 2024, vol. 12, issue 8, 1-20

Abstract: Network alignment is an important technique with applications in diverse domains, such as social network analysis, bioinformatics, and knowledge graph construction. Many of the alignment methods rely on predefined anchor nodes, which are often unavailable in real-world scenarios. To overcome this limitation, we propose MANNA (MAtched Neighbor consistency for Network Alignment), an unsupervised approach to network alignment that exploits the concept of Matched Neighborhood Consistency (MNC). The hypothesis of MANNA is that nodes with higher similarity within their local neighborhood structures are more likely to be aligned across different networks. To learn the structural and attribute features of networks, MANNA uses a Graph Neural Network (GNN). It extracts multi-order node embeddings to capture multi-scale neighborhood features, which are then used to construct similarity matrices for the alignment process. MANNA introduces a key innovation by using pseudo-anchor nodes identified by the MNC strategy to provide self-supervised learning signals in the absence of real anchor nodes. This approach enhances the model’s ability to learn accurate network representations and improve alignment accuracy. Alignment results are iteratively refined by applying the MNC strategy, which strengthens the consistency of neighborhood structures between matched nodes. Extensive experiments on three public datasets show that MANNA outperforms existing network alignment methods.

Keywords: network alignment; graph neural network; matched neighborhood consistency; pseudo-anchor nodes; self-supervised learning (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/8/1211/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/8/1211/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:8:p:1211-:d:1377639

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().