Logo Logo
Help
Contact
Switch Language to German

Damke, Clemens ORCID logoORCID: https://orcid.org/0000-0002-0455-0048 und Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 (September 2024): CUQ-GNN: Committee-Based Graph Uncertainty Quantification Using Posterior Networks. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2024), Vilnius, Lithuania, 9. - 13. September 2024. In: Machine Learning and Knowledge Discovery in Databases Part VIII, Proc. ECML PKDD 2024, LNCS Vol. 14948 Cham: Springer. pp. 306-323 [PDF, 2MB]

[thumbnail of 2409.04159v1.pdf]
Preview
Creative Commons Attribution
Draft Version

Abstract

In this work, we study the influence of domain-specific characteristics when defining a meaningful notion of predictive uncertainty on graph data. Previously, the so-called Graph Posterior Network (GPN) model has been proposed to quantify uncertainty in node classification tasks. Given a graph, it uses Normalizing Flows (NFs) to estimate class densities for each node independently and converts those densities into Dirichlet pseudo-counts, which are then dispersed through the graph using the personalized Page-Rank (PPR) algorithm. The architecture of GPNs is motivated by a set of three axioms on the properties of its uncertainty estimates. We show that those axioms are not always satisfied in practice and therefore propose the family of Committe-based Uncertainty Quantification Graph Neural Networks (CUQ-GNNs), which combine standard Graph Neural Networks (GNNs) with the NF-based uncertainty estimation of Posterior Networks (PostNets). This approach adapts more flexibly to domain-specific demands on the properties of uncertainty estimates. We compare CUQ-GNN against GPN and other uncertainty quantification approaches on common node classification benchmarks and show that it is effective at producing useful uncertainty estimates.

Actions (login required)

View Item View Item