Graphkernels: R and Python packages for graph comparison

31Citations
Citations of this article
125Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Summary Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-The-Art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples.

Cite

CITATION STYLE

APA

Sugiyama, M., Ghisu, M. E., Llinares-López, F., & Borgwardt, K. (2018). Graphkernels: R and Python packages for graph comparison. Bioinformatics, 34(3), 530–532. https://doi.org/10.1093/bioinformatics/btx602

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free