BriefGPT.xyz
Jun, 2012
属性图的子图匹配核函数
Subgraph Matching Kernels for Attributed Graphs
HTML
PDF
Nils Kriege, Petra Mutzel
TL;DR
论文通过提出基于子图匹配的图内核来解决无属性子图匹配内核所面临的属性不匹配的问题，并通过灵活的打分方案对子图匹配进行评分。作者还提出了用于计算内核的图论算法，并在对真实世界图进行分类任务时取得了鼓舞人心的实验结果。
Abstract
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., 200
→