Learning Graph Laplacian from Intrinsic Patterns via Gaussian Process | IEEE Conference Publication | IEEE Xplore

Learning Graph Laplacian from Intrinsic Patterns via Gaussian Process


Abstract:

In this paper, we present a novel scheme to learn a graph topology named Laplacian constrained Gaussian process (LCGP). Previous graph learning methods directly use raw o...Show More

Abstract:

In this paper, we present a novel scheme to learn a graph topology named Laplacian constrained Gaussian process (LCGP). Previous graph learning methods directly use raw observed signals, which often degrades estimation accuracy due to the noise effects and the sample imbalances. LCGP tackles this problem by introducing a small number of intrinsic patterns, that is, LCGP assumes representative signals on a graph. These signals are derived as Bayesian latent variables, and we estimate the graph topology with objective after marginalizing them. Furthermore, the number of the intrinsic patterns is automatically determined by a Bayesian inference procedure. In the experiment, we compared LCGP with baseline and state-of-the-art methods in graph learning and confirmed the effectiveness of LCGP.
Date of Conference: 04-10 June 2023
Date Added to IEEE Xplore: 05 May 2023
ISBN Information:

ISSN Information:

Conference Location: Rhodes Island, Greece

Contact IEEE to Subscribe

References

References is not available for this document.