Examples

Examples that use graph kernels to perform various tasks (e.g., graph classification, retrieval of most similar document, etc).

Example of building a graph classification pipeline.

Graph classification on MUTAG using the shortest path kernel.

Graph classification on a dataset that contains node-attributed graphs.

Performing cross-validation n times, optimizing SVM’s and kernel’s hyperparameters.

Graph classification on MUTAG using the Weisfeiler-Lehman subtree kernel.

Graph classification on a randomly generated dataset of Erdos-Renyi graphs.

Retrieval of most similar document using the Weisfeiler-Lehman subtree kernel.

Example of transforming NetworkX graphs to GraKeL graphs.