You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

metadata.py 1.4 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748
  1. #!/usr/bin/env python3
  2. # -*- coding: utf-8 -*-
  3. """
  4. Created on Fri Nov 6 10:11:08 2020
  5. @author: ljia
  6. """
  7. from gklearn.kernels.common_walk import CommonWalk
  8. from gklearn.kernels.marginalized import Marginalized
  9. from gklearn.kernels.sylvester_equation import SylvesterEquation
  10. from gklearn.kernels.conjugate_gradient import ConjugateGradient
  11. from gklearn.kernels.fixed_point import FixedPoint
  12. from gklearn.kernels.spectral_decomposition import SpectralDecomposition
  13. from gklearn.kernels.shortest_path import ShortestPath
  14. from gklearn.kernels.structural_sp import StructuralSP
  15. from gklearn.kernels.path_up_to_h import PathUpToH
  16. from gklearn.kernels.treelet import Treelet
  17. from gklearn.kernels.weisfeiler_lehman import WLSubtree
  18. # The metadata of all graph kernels.
  19. GRAPH_KERNELS = {
  20. ### based on walks.
  21. 'common walk': CommonWalk,
  22. 'marginalized': Marginalized,
  23. 'sylvester equation': SylvesterEquation,
  24. 'fixed point': FixedPoint,
  25. 'conjugate gradient': ConjugateGradient,
  26. 'spectral decomposition': SpectralDecomposition,
  27. ### based on paths.
  28. 'shortest path': ShortestPath,
  29. 'structural shortest path': StructuralSP,
  30. 'path up to length h': PathUpToH,
  31. ### based on non-linear patterns.
  32. 'weisfeiler-lehman subtree': WLSubtree,
  33. 'treelet': Treelet,
  34. }
  35. def list_of_graph_kernels():
  36. """List names of all graph kernels.
  37. Returns
  38. -------
  39. list
  40. The list of all graph kernels.
  41. """
  42. return [i for i in GRAPH_KERNELS]

A Python package for graph kernels, graph edit distances and graph pre-image problem.