Cookies on this website

We use cookies to ensure that we give you the best experience on our website. If you click 'Accept all cookies' we'll assume that you are happy to receive all cookies and you won't see this message again. If you click 'Reject all non-essential cookies' only necessary cookies providing core functionality such as security, network management, and accessibility will be enabled. Click 'Find out more' for information on how to change your cookie settings.

We propose a graph spectrum-based Gaussian process for prediction of signals defined on nodes of the graph. The model is designed to capture various graph signal structures through a highly adaptive kernel that incorporates a flexible polynomial function in the graph spectral domain. Unlike most existing approaches, we propose to learn such a spectral kernel defined on a discrete space. In addition, this kernel has the interpretability of graph filtering achieved by a bespoke maximum likelihood learning algorithm that enforces the positivity of the spectrum. We demonstrate the interpretability of the model through synthetic experiments from which we show various ground truth spectral filters can be accurately recovered, and the adaptability translates to improved predictive performances compared to the baselines on real-world graph data of various characteristics.

Original publication

DOI

10.1109/TSIPN.2023.3265160

Type

Journal article

Journal

IEEE Transactions on Signal and Information Processing over Networks

Publication Date

01/01/2023

Volume

9

Pages

304 - 314