Fast depth-based subgraph kernels for unattributed graphs
作者：
Highlights：
• We investigate two fast subgraph kernels based on a depth-based representation.
• Our kernels gauge depth information rooted at a vertex for a graph.
• The time complexities for the two kernels are O(n2) and O(n3).
• We evaluate the performance of our subgraph kernels on standard graph datasets.
• We demonstrate the effectiveness of the proposed subgraph kernels.
摘要
Highlights•We investigate two fast subgraph kernels based on a depth-based representation.•Our kernels gauge depth information rooted at a vertex for a graph.•The time complexities for the two kernels are O(n2) and O(n3).•We evaluate the performance of our subgraph kernels on standard graph datasets.•We demonstrate the effectiveness of the proposed subgraph kernels.
论文关键词：Depth-based representations,Entropy,Graph kernels,The Jensen–Shannon divergence,Graph isomorphism tests
论文评审过程：Received 28 July 2014, Revised 17 June 2015, Accepted 7 August 2015, Available online 19 August 2015, Version of Record 5 November 2015.
论文官网地址：https://doi.org/10.1016/j.patcog.2015.08.006
