Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Kernels on graphs"”.
-
A non-asymptotic study of low-rank estimation of smooth kernels on graphs
This dissertation investigates the problem of estimating a kernel over a large graph based on a sample of noisy observations of linear measurements of the kernel. We are interested in solving this estimation problem in the case when the sample size is much smaller than the ambient dimension of the …
-
Incorporating Linear Dependencies into Graph Gaussian Processes
… important technique for learning unknown functions on graphs while quantifying uncertainty. These processes encode prior information by using kernels that reflect the structure of the graph, allowing function values at nearby nodes to be correlated. However, there are limited choices for kernels …
-
Gaussian processes on graphs
… field of machine learning research, the use of graphs has recently gathered significant interest for modelling on data with relational structures. Graphs and network-based data now exist ubiquitously in the real world, with examples including social networks, transportation, financial exchanges, …
-
Kernel-based Reconstruction of Dynamic Functions over Dynamic Graphs
… A challenging problem encountered in this context pertains to determining the attributes of a set of vertices given those of another subset at possibly dierent time instants. Leveraging spatiotemporal dynamics and prior information can drastically reduce the number of observed vertices, and …
-
Graph Kernels
As new graph structured data is constantly being generated, learning and data mining on graphs have become a challenge in application areas such as molecular biology, telecommunications, chemoinformatics, and social network analysis. The central algorithmic problem in these areas, measuring …