We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The problem of accurately measuring the similarity between graphs is at the core of many applications in a variety of disciplines. Graph kernels have recently emerged as a promising approach to this problem. There are now many kernels, each focusing on different structural aspects of graphs. Here, we present GraKeL, a library that unifies several graph kernels into a common framework. The library is written in Python and adheres to the scikit-learn interface. It is simple to use and can be naturally combined with scikit-learn's modules to build a complete machine learning pipeline for tasks such as graph classification and clustering. The code is BSD licensed and is available at: https://github.com/ysig/GraKeL .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1806.02193")
get_code_for_paper("1806.02193")
have("1806.02193")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1806.02193.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1806.02193)
Connect an agent — have() is free.