Subgraph Matching Kernels for Attributed Graphs

Understand

We propose graph kernels based on subgraph matchings, i.e.

• structure-preserving bijections between subgraphs.
• While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to attributed graphs, our approach allows to rate mappings of subgraphs by a flexible scoring scheme comparing vertex and edge attributes by kernels.
• We show that subgraph matching kernels generalize several known kernels.