Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

GraKeL: A Graph Kernel Library in Python

About

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 .

Giannis Siglidis, Giannis Nikolentzos, Stratis Limnios, Christos Giatsidis, Konstantinos Skianis, Michalis Vazirgiannis• 2018

Related benchmarks

TaskDatasetResultRank
Graph Distribution Classification and ClusteringER, RP, SBM, RG graph distributions
Accuracy90
31
Graph classification (trajectory- vs cluster-like)Single-cell graphs All Graphs (full set)
Accuracy68.5
28
Graph classification (trajectory- vs cluster-like)Single-cell graphs Gold subset
Accuracy78.5
27
Graph Distribution ClassificationRandom Graph Models ER, RP, RG, SBM
Accuracy90
8
Graph Parameter ClassificationErdős-Rényi (ER) random graph model
Accuracy100
8
Graph Parameter ClassificationRandom Partition (RP)
Accuracy97
8
Graph Parameter ClassificationStochastic block model (SBM)
Accuracy80
8
Graph Parameter ClassificationRandom Geometric (RG) Graph
Accuracy93
8
Binary Graph ClassificationAll 169 Graphs (5-fold stratified CV)
Accuracy (Test)68.5
6
Binary Graph ClassificationGold 87 Graphs (5-fold stratified CV)
Test Accuracy78.5
5
Showing 10 of 10 rows

Other info

Follow for update