<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=171323"><dc:title>The Influence of the Relational Schema on the Performance of Graph Neural Networks</dc:title><dc:creator>Longar,	Mark David	(Avtor)
	</dc:creator><dc:creator>Šubelj,	Lovro	(Mentor)
	</dc:creator><dc:subject>graph neural networks</dc:subject><dc:subject>relational deep learning</dc:subject><dc:subject>over-squashing</dc:subject><dc:subject>graph rewiring</dc:subject><dc:description>Relational deep learning applies graph neural networks to data stored in
relational databases by constructing graphs directly from database schemas.
This thesis investigates how relational database schemas influence graph neural
network performance, focusing on the over-squashing phenomenon that
limits information propagation. We demonstrate that graphs derived from relational
schemas exhibit performance patterns consistent with over-squashing
theory, where models perform well with shallow networks but degrade with
increased depth due to topological bottlenecks. To address these limitations,
we develop two graph rewiring approaches: a computationally efficient approximation
of Stochastic Discrete Ricci Flow and a schema-aware heuristic
method that leverages domain knowledge about relational structures. Experimental
results on two datasets show that targeted rewiring strategies can
provide substantial performance improvements, suggesting that graph topology
should be considered a design choice rather than a fixed constraint in
relational deep learning systems.</dc:description><dc:date>2025</dc:date><dc:date>2025-08-22 11:05:00</dc:date><dc:type>Diplomsko delo/naloga</dc:type><dc:identifier>171323</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
