{"id":729,"date":"2017-03-12T12:11:00","date_gmt":"2017-03-12T12:11:00","guid":{"rendered":"http:\/\/www.kelp-ml.org\/?page_id=729"},"modified":"2017-03-13T17:33:57","modified_gmt":"2017-03-13T17:33:57","slug":"kernels-on-graphs","status":"publish","type":"page","link":"http:\/\/www.kelp-ml.org\/?page_id=729","title":{"rendered":"Kernels on Graphs"},"content":{"rendered":"<p>They are\u00a0<a href=\"http:\/\/www.kelp-ml.org\/kelp-javadoc\/current-version\/it\/uniroma2\/sag\/kelp\/kernel\/DirectKernel.html\">DirectKernel<\/a>s operating on\u00a0<a href=\"http:\/\/www.kelp-ml.org\/kelp-javadoc\/current-version\/it\/uniroma2\/sag\/kelp\/data\/representation\/graph\/DirectedGraphRepresentation.html\">DirectedGraphRepresention<\/a>s<strong>.<\/strong><\/p>\n<hr \/>\n<h3>Shortest Path Kernel<\/h3>\n<p><strong>Java class<\/strong>: <a href=\"http:\/\/www.kelp-ml.org\/kelp-javadoc\/current-version\/it\/uniroma2\/sag\/kelp\/kernel\/graph\/ShortestPathKernel.html\">ShortestPathKernel<\/a><\/p>\n<p><strong>Source code<\/strong>: <a href=\"https:\/\/github.com\/SAG-KeLP\/kelp-additional-kernels\/blob\/master\/src\/main\/java\/it\/uniroma2\/sag\/kelp\/kernel\/graph\/ShortestPathKernel.java\" target=\"_blank\">ShortestPathKernel.java<\/a><\/p>\n<p><strong>Maven Project<\/strong>: <a href=\"https:\/\/github.com\/SAG-KeLP\/kelp-additional-kernels\">kelp-additional-kernels<\/a><\/p>\n<p><strong>JSON type<\/strong>: shortestPath<\/p>\n<p><strong>Description<\/strong>: it\u00a0associates 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\u00a0and\u00a0Kriegel, 2005).<\/p>\n<p><strong>Parameters<\/strong>:<\/p>\n<ul>\n<li><em>representation<\/em>: the String identifying the representation on which the kernel must operate<\/li>\n<\/ul>\n<hr \/>\n<h3>Weisfeiler\u2013Lehman Subtree Kernel<\/h3>\n<p><strong>Java class<\/strong>: <a href=\"http:\/\/www.kelp-ml.org\/kelp-javadoc\/current-version\/it\/uniroma2\/sag\/kelp\/data\/manipulator\/WLSubtreeMapper.html\">WLSubtreeMapper<\/a>\u00a0to manipulate the dataset instances and obtain the explicit vectors to be used by a\u00a0<a href=\"http:\/\/www.kelp-ml.org\/kelp-javadoc\/current-version\/it\/uniroma2\/sag\/kelp\/kernel\/vector\/LinearKernel.html\">LinearKernel<\/a><\/p>\n<p><strong>Maven Project<\/strong>: <a href=\"https:\/\/github.com\/SAG-KeLP\/kelp-additional-kernels\">kelp-additional-kernels<\/a><\/p>\n<p><strong>Description<\/strong>: it is actually an explicit feature extractor that outputs vectors containing the features of the <span class=\"s1\">Weisfeiler<\/span><span class=\"s2\">\u2013<\/span><span class=\"s1\">Lehman<\/span> Subtree Kernel for Graphs (Shervashidze, 2011). A <a href=\"http:\/\/www.kelp-ml.org\/kelp-javadoc\/current-version\/it\/uniroma2\/sag\/kelp\/kernel\/vector\/LinearKernel.html\">LinearKernel<\/a>\u00a0can be used to exploit the produced vectors.<\/p>\n<hr \/>\n<h3>References<\/h3>\n<p>K. M. <span class=\"s1\">Borgwardt<\/span> and H.<span class=\"s2\">\u2013<\/span>P. <span class=\"s1\">Kriegel.\u00a0<\/span><em>Shortest<span class=\"s2\">\u2013<\/span>Path Kernels on Graphs<\/em>. in Proceedings of the Fifth IEEE International Conference on Data Mining, 2005, <span class=\"s1\">pp<\/span>. 74\u201381.<\/p>\n<p>N. <span class=\"s1\">Shervashidze<\/span>, <em><span class=\"s1\">Weisfeiler<\/span><span class=\"s2\">\u2013<\/span><span class=\"s1\">lehman<\/span> graph kernels<\/em>, JMLR, <span class=\"s1\">vol<\/span>. 12, <span class=\"s1\">pp<\/span>. 2539\u20132561, 2011<\/p>\n","protected":false},"excerpt":{"rendered":"<p>They are\u00a0DirectKernels operating on\u00a0DirectedGraphRepresentions. Shortest Path Kernel Java class: ShortestPathKernel Source code: ShortestPathKernel.java Maven Project: kelp-additional-kernels JSON type: shortestPath Description: it\u00a0associates 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 <a href=\"http:\/\/www.kelp-ml.org\/?page_id=729\" rel=\"nofollow\"><span class=\"sr-only\">Read more about Kernels on Graphs<\/span>[&hellip;]<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/www.kelp-ml.org\/index.php?rest_route=\/wp\/v2\/pages\/729"}],"collection":[{"href":"http:\/\/www.kelp-ml.org\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.kelp-ml.org\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.kelp-ml.org\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.kelp-ml.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=729"}],"version-history":[{"count":8,"href":"http:\/\/www.kelp-ml.org\/index.php?rest_route=\/wp\/v2\/pages\/729\/revisions"}],"predecessor-version":[{"id":792,"href":"http:\/\/www.kelp-ml.org\/index.php?rest_route=\/wp\/v2\/pages\/729\/revisions\/792"}],"wp:attachment":[{"href":"http:\/\/www.kelp-ml.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=729"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}