# Sensor selection on graphs via data-driven node sub-sampling in network time series

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Apr 2020.

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

- [Reconstructing nodal pressures in water distribution systems with graph neural networks](https://mlsanity.com/paper/2104.13619/) (2021)
- [Wasserstein multivariate auto-regressive models for modeling distributional time series](https://mlsanity.com/paper/2207.05442/) (2022)

## Abstract (arXiv)

This paper is concerned by the problem of selecting an optimal sampling set of sensors over a network of time series for the purpose of signal recovery at non-observed sensors with a minimal reconstruction error. The problem is motivated by applications where time-dependent graph signals are collected over redundant networks. In this setting, one may wish to only use a subset of sensors to predict data streams over the whole collection of nodes in the underlying graph. A typical application is the possibility to reduce the power consumption in a network of sensors that may have limited battery supplies. We propose and compare various data-driven strategies to turn off a fixed number of sensors or equivalently to select a sampling set of nodes. We also relate our approach to the existing literature on sensor selection from multivariate data with a (possibly) underlying graph structure. Our methodology combines tools from multivariate time series analysis, graph signal processing, statistical learning in high-dimension and deep learning. To illustrate the performances of our approach, we report numerical experiments on the analysis of real data from bike sharing networks in different cities.