Graph Kernels: State-of-the-Art and Future Challenges
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.
Cite
Text
Borgwardt et al. "Graph Kernels: State-of-the-Art and Future Challenges." Foundations and Trends in Machine Learning, 2020. doi:10.1561/2200000076Markdown
[Borgwardt et al. "Graph Kernels: State-of-the-Art and Future Challenges." Foundations and Trends in Machine Learning, 2020.](https://mlanthology.org/ftml/2020/borgwardt2020ftml-graph/) doi:10.1561/2200000076BibTeX
@article{borgwardt2020ftml-graph,
title = {{Graph Kernels: State-of-the-Art and Future Challenges}},
author = {Borgwardt, Karsten M. and Ghisu, M. Elisabetta and Llinares-López, Felipe and O'Bray, Leslie and Rieck, Bastian},
journal = {Foundations and Trends in Machine Learning},
year = {2020},
doi = {10.1561/2200000076},
volume = {13},
url = {https://mlanthology.org/ftml/2020/borgwardt2020ftml-graph/}
}