Learn R Programming

graphkernels (version 1.6.1)

Graph Kernels

Description

A fast C++ implementation for computing various graph kernels including (1) simple kernels between vertex and/or edge label histograms, (2) graphlet kernels, (3) random walk kernels (popular baselines), and (4) the Weisfeiler-Lehman graph kernel (state-of-the-art).

Copy Link

Version

Install

install.packages('graphkernels')

Monthly Downloads

248

Version

1.6.1

License

GPL (>= 2)

Maintainer

Mahito Sugiyama

Last Published

December 20th, 2021

Functions in graphkernels (1.6.1)

CalculateGeometricRandomWalkKernel

Geometric random walk kernel
CalculateEdgeHistKernel

Linear kernel between edge label histograms
CalculateGraphletKernelCpp

An C++ implementation of graphlet kernels
CalculateGraphletKernel

Graphlet kernel
CalculateKStepRandomWalkKernel

k-step random walk kernel
CalculateExponentialRandomWalkKernel

Exponential random walk kernel
CalculateVertexEdgeHistKernel

Linear kernel between vertex-edge label histograms
CalculateVertexEdgeHistGaussKernel

Gaussian RBF kernel between vertex-edge label histograms
CalculateVertexVertexEdgeHistKernel

Linear kernel combination of vertex label histograms and vertex-edge label histograms
CalculateEdgeHistGaussKernel

Gaussian RBF kernel between edge label histograms
CalculateConnectedGraphletKernel

Connected graphlet kernel
CalculateWLKernel

Weisfeiler-Lehman subtree kernel
graphkernels_CalculateGraphletKernelCpp

Symbol registration
graphkernels_CalculateKernelCpp

Symbol registration
CalculateKernelCpp

An C++ implementation of graph kernels
CalculateShortestPathKernel

Shortest-path kernel
GetGraphInfo

Necessary information of graphs for kernel computation
graphkernels-package

Graph Kernels
CalculateVertexHistGaussKernel

Gaussian RBF kernel between vertex label histograms
mutag

The mutag dataset
CalculateVertexHistKernel

Linear kernel between vertex label histograms