paper-with-me

홈 › Papers

Graph Classification Gaussian Processes via Spectral Features

2023-06-06 · Felix L. Opolka, Yin-Cong Zhi, Pietro Liò, Xiaowen Dong

Graph classification aims to categorise graphs based on their structure and node attributes. In this work, we propose to tackle this task using tools from graph signal processing by deriving spectral features, which we then use to design two variants of Gaussian process models for graph classification. The first variant uses spectral features based on the distribution of energy of a node feature signal over the spectrum of the graph. We show that even such a simple approach, having no learned parameters, can yield competitive performance compared to strong neural network and graph kernel baselines. A second, more sophisticated variant is designed to capture multi-scale and localised patterns in the graph by learning spectral graph wavelet filters, obtaining improved performance on synthetic and real-world data sets. Finally, we show that both models produce well calibrated uncertainty estimates, enabling reliable decision making based on the model predictions.

📄 PDF Abstract BibTeX arXiv:2306.03770

Code (0)

등록된 구현이 없습니다.

Tasks

ClassificationDecision MakingGaussian ProcessesGraph Classification

Methods 이 논문이 사용한 방법론

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Similar Papers 제목 키워드 기반

Graph Classification Gaussian Processes via Hodgelet Spectral Features

2024-10-14 · Mathieu Alain, So Takao, Xiaowen Dong, Bastian Rieck 외

The problem of classifying graphs is ubiquitous in machine learning. While it is standard to apply graph neural networks or graph kernel methods, Gaussian processes can be employed by transforming spatial features from t…

ClassificationGaussian ProcessesGraph Classification

Infinite Width Graph Neural Networks for Node Regression/ Classification

2023-10-12 · Yunus Cobanoglu

This work analyzes Graph Neural Networks, a generalization of Fully-Connected Deep Neural Nets on Graph structured data, when their width, that is the number of nodes in each fullyconnected layer is increasing to infinit…

Gaussian ProcessesGraph AttentionGraph LearningGraph Neural Network+3

Variational Fourier features for Gaussian processes

2016-11-21 · James Hensman, Nicolas Durrande, Arno Solin

This work brings together two powerful concepts in Gaussian processes: the variational approach to sparse approximation and the spectral representation of Gaussian processes. This gives rise to an approximation that inhe…

Gaussian Processes

Machine learning based hyperspectral image analysis: A survey

2018-02-23 · Utsav B. Gewali, Sildomar T. Monteiro, Eli Saber

Hyperspectral sensors enable the study of the chemical properties of scene materials remotely for the purpose of identification, detection, and chemical composition analysis of objects in the environment. Hence, hyperspe…

BIG-bench Machine LearningClusteringEnsemble LearningGaussian Processes+5

Regular Fourier Features for Nonstationary Gaussian Processes

2026-02-26 · Arsalan Jawaid, Abdullah Karatas, Jörg Seewig arxiv

Simulating a Gaussian process requires sampling from a high-dimensional Gaussian distribution, which scales cubically with the number of sample locations. Spectral methods address this challenge by exploiting the Fourier…

Gaussian Processes