Shortest Path Kernel

Description: it associates a feature to each pair of nodes of one graph. The feature name corresponds to pair of node labels while the value is the length of the shortest path between the nodes in the graph. Further details can be found in (Borgwardt and Kriegel, 2005).

Parameters:

representation: the String identifying the representation on which the kernel must operate

Weisfeiler–Lehman Subtree Kernel

Description: it is actually an explicit feature extractor that outputs vectors containing the features of the Weisfeiler–Lehman Subtree Kernel for Graphs (Shervashidze, 2011). A LinearKernel can be used to exploit the produced vectors.