Towards Higher-order Topological Consistency for Unsupervised Network Alignment
Qingqiang Sun, Xuemin Lin, Ying Zhang, Wenjie Zhang, Chaoqi Chen
Abstract
Network alignment task, which aims to identify corresponding nodes in different networks, is of great significance for many subsequent applications. Without the need for labeled anchor links, unsupervised alignment methods have been attracting more and more attention. However, the topological consistency assumptions defined by existing methods are generally low-order and less accurate because only the edge-indiscriminative topological pattern is considered, which is especially risky in an unsupervised setting. To reposition the focus of the alignment process from low-order to higher-order topological consistency, in this paper, we propose a fully unsupervised network alignment framework named HTC. The proposed higher-order topological consistency is formulated based on edge orbits, which is merged into the information aggregation process of a graph convolutional network so that the alignment consistencies are transformed into the similarity of node embeddings. Furthermore, the encoder is trained to be multi-orbit-aware and then is refined to identify more trusted anchor links. Node correspondence is comprehensively evaluated by integrating all different orders of consistency. In addition to sound theoretical analysis, the superiority of the proposed method is also empirically demonstrated through extensive experimental evaluation. On three pairs of real-world datasets and two pairs of synthetic datasets, our HTC consistently outperforms a wide variety of unsupervised and supervised methods with the least or comparable time consumption. It also exhibits robustness to structural noise as a result of our multiorbit-aware training mechanism.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext aed7c667-ef46-40fe-9ac9-dc223c1deb9cCited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Unsupervised Graph Alignment with Wasserstein Distance DiscriminatorJi Gao, Xiao Huang, Jundong LiKDD 2021 · 53 citations
- Hypergraph Learning for Unsupervised Graph Alignment via Optimal TransportYuguang Yan, Canlin Yang, Yuanlin Chen, Ruichu Cai et al.AAAI 2025 · 2 citations
- CINA: Curvature-Based Integrated Network Alignment with HypergraphPengfei Jiao, Yuanqi Liu, Yinghui Wang, Ge ZhangICDE 2024 · 4 citations
- Multi-order Matched Neighborhood Consistent Graph Alignment in a Union Vector SpaceWei Tang, Haifeng Sun, Jingyu Wang, Qi Qi et al.SIGIR 2023 · 9 citations
- Balancing Consistency and Disparity in Network AlignmentSi Zhang, Hanghang Tong, Long Jin, Yinglong Xia et al.KDD 2021 · 46 citations
