# Graph Neural Network for Crawling Target Nodes in Social Networks

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 19 references that are in the map.
- First posted on arXiv 20 Mar 2024.

## Builds on (most cited first, 5 of 5)

- [Semi-Supervised Classification with Graph Convolutional Networks](https://mlsanity.com/paper/1609.02907/) (2016)
- [Graph Attention Networks](https://mlsanity.com/paper/1710.10903/) (2017)
- [Inductive Representation Learning on Large Graphs](https://mlsanity.com/paper/1706.02216/) (2017)
- [Selective Harvesting over Networks](https://mlsanity.com/paper/1703.05082/) (2017)
- [Selective Network Discovery via Deep Reinforcement Learning on Embedded Spaces](https://mlsanity.com/paper/1909.07294/) (2019)

## Abstract (arXiv)

Social networks crawling is in the focus of active research the last years. One of the challenging task is to collect target nodes in an initially unknown graph given a budget of crawling steps. Predicting a node property based on its partially known neighbourhood is at the heart of a successful crawler. In this paper we adopt graph neural networks for this purpose and show they are competitive to traditional classifiers and are better for individual cases. Additionally we suggest a training sample boosting technique, which helps to diversify the training set at early stages of crawling and thus improves the predictor quality. The experimental study on three types of target set topology indicates GNN based approach has a potential in crawling task, especially in the case of distributed target nodes.