mlsanityData to 7 Oct 2026

Towards Higher-order Topological Consistency for Unsupervised Network Alignment

arXiv 2208.12463 ↗First posted 26 Aug 2022cs.LG cs.SIcited by 3

Not on the map. Why?

Abstract (arXiv)

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 be 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 multi-orbit-aware training mechanism.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 13 of its 52 references that are in the map. First posted on arXiv 26 Aug 2022.

Builds on

13 of 52 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  5. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  6. 2016Variational Graph Auto-Encoderscited by 1,373
  7. 2015LINE: Large-scale Information Network Embeddingcited by 582
  8. 2019Diffusion Improves Graph Learningcited by 414
  9. 2018MotifNet: a motif-based Graph Convolutional Network for directed graphscited by 63
  10. 2014Improving zero-shot learning by mitigating the hubness problemcited by 53
  11. 2018REGAL: Representation Learning-based Graph Alignmentcited by 40
  12. 2015Triangular Alignment (TAME): A Tensor-based Approach for Higher-order Network Alignmentcited by 4
1 more
  1. 2014GREAT: GRaphlet Edge-based network AlignmenTcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 1.

3 papers.