Graph kernels have become an established and widely-used technique for solving classification tasks on graphs. This survey gives a comprehensive overview of techniques for kernel-based graph classification developed in the past 15 years. We describe and categorize graph kernels based on properties inherent to their design, such as the nature of their extracted graph features, their method of computation and their applicability to problems in practice. In an extensive experimental evaluation, we study the classification accuracy of a large suite of graph kernels on established benchmarks as well as new datasets. We compare the performance of popular kernels with several baseline methods and study the effect of applying a Gaussian RBF kernel to the metric induced by a graph kernel. In doing so, we find that simple baselines become competitive after this transformation on some datasets. Moreover, we study the extent to which existing graph kernels agree in their predictions (and prediction errors) and obtain a data-driven categorization of kernels as result. Finally, based on our experimental results, we derive a practitioner's guide to kernel-based graph classification.

本研究总结了过去 15 年中用于核心基础图分类问题的技术，并在一系列基准测试和新数据集上对几种热门核进行了性能比对，发现对于某些数据集，简单的基准测试经过高斯 RBF 核转换后可以得到竞争性的结果；此外，还对现有的图核进行了实证研究，并据此得出了一个从数据角度出发的核分类方案。最后，基于实验结果，本文为核基础图分类提供了从实践角度出发的指南。

图内核调查