GraKeL Logo
0.1.8
  • Documentation
  • Benchmarks
  • GraKeL
    • Kernels (between graphs)
      • Core Kernel Framework
      • Edge Histogram Kernel
      • Graph Hopper Kernel
      • Graphlet Sampling Kernel
      • Hadamard Code Kernel
      • Kernel (general class)
      • Lovasz Theta Kernel
      • Multiscale Laplacian Kernel
      • Neighborhood Hash Kernel
      • Neighborhood Subgraph Pairwise Distance Kernel
      • ODD-STh Kernel
      • Propagation Kernel
      • Pyramid Match Kernel
      • Random Walk Kernel
      • Shortest Path Kernel
      • Subgraph Matching Kernel
      • SVM Theta Kernel
      • Vertex Histogram Kernel
      • Weisfeiler Lehman Framework
      • Weisfeiler-Lehman Optimal Assignment
    • GraphKernel (class)
    • Graph (class)
    • Dataset loading utilities
  • API Reference
  • Examples
  • Tutorials
GraKeL
  • »
  • GraKeL »
  • Kernels (between graphs)
  • View page source

Kernels (between graphs)ΒΆ

The documentation of the kernels submodule.

  • Core Kernel Framework
  • Edge Histogram Kernel
  • Graph Hopper Kernel
  • Graphlet Sampling Kernel
  • Hadamard Code Kernel
  • Kernel (general class)
  • Lovasz Theta Kernel
  • Multiscale Laplacian Kernel
  • Neighborhood Hash Kernel
  • Neighborhood Subgraph Pairwise Distance Kernel
  • ODD-STh Kernel
  • Propagation Kernel
  • Pyramid Match Kernel
  • Random Walk Kernel
  • Shortest Path Kernel
  • Subgraph Matching Kernel
  • SVM Theta Kernel
  • Vertex Histogram Kernel
  • Weisfeiler Lehman Framework
  • Weisfeiler-Lehman Optimal Assignment
Next Previous

© Copyright 2019, DaSciM (BSD License).

Built with Sphinx using a theme provided by Read the Docs.