# Learning Topological Representation for Networks via Hierarchical Sampling

arXiv: https://arxiv.org/abs/1902.06684 · HTML: https://mlsanity.com/paper/1902.06684/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Feb 2019.

## Built on by (most cited first, 3 of 3)

- [Learning Graph Representation by Aggregating Subgraphs via Mutual Information Maximization](https://mlsanity.com/paper/2103.13125/) (2021)
- [HeteroMILE: a Multi-Level Graph Representation Learning Framework for Heterogeneous Graphs](https://mlsanity.com/paper/2404.00816/) (2024)
- [Learning node embeddings via summary graphs: a brief theoretical analysis](https://mlsanity.com/paper/2207.01189/) (2022)

## Abstract (arXiv)

The topological information is essential for studying the relationship between nodes in a network. Recently, Network Representation Learning (NRL), which projects a network into a low-dimensional vector space, has been shown their advantages in analyzing large-scale networks. However, most existing NRL methods are designed to preserve the local topology of a network, they fail to capture the global topology. To tackle this issue, we propose a new NRL framework, named HSRL, to help existing NRL methods capture both the local and global topological information of a network. Specifically, HSRL recursively compresses an input network into a series of smaller networks using a community-awareness compressing strategy. Then, an existing NRL method is used to learn node embeddings for each compressed network. Finally, the node embeddings of the input network are obtained by concatenating the node embeddings from all compressed networks. Empirical studies for link prediction on five real-world datasets demonstrate the advantages of HSRL over state-of-the-art methods.