about
Graph Kernels: State-of-the-Art and Future Challenges (arxiv.org)
1 point by sebg on Nov 13, 2020 | hide | past | pdf | discuss on HN

In plain words: Graph kernels are scoring tools that measure how alike two networks are, letting computers sort or predict on data shaped like molecules or social connections. This survey collects the main designs, their uses and resources, and tests today's best ones side by side.

Abstract

Graph-structured data are an integral part of many application domains, including chemoinformatics, computational biology, neuroimaging, and social network analysis. Over the last two decades, numerous graph kernels, i.e. kernel functions between graphs, have been proposed to solve the problem of assessing the similarity between graphs, thereby making it possible to perform predictions in both classification and regression settings. This manuscript provides a review of existing graph kernels, their applications, software plus data resources, and an empirical comparison of state-of-the-art graph kernels.

Karsten Borgwardt, Elisabetta Ghisu, Felipe Llinares-López, Leslie O'Bray, Bastian Rieck
arXiv:2011.03854 · cs.LG, stat.ML · submitted Nov 7, 2020 · updated Nov 10, 2020
abstract · pdf · html · Accepted by Foundations and Trends in Machine Learning, 2020

add comment on HN