Weisfeiler-Lehman Graph Kernels

Journal of Machine Learning Research, pp. 2539-2561, 2011.

被引用961|浏览29
EI

摘要

In this article, we propose a family of efficient kernels for large graphs with discrete node labels. Key to our method is a rapid feature extraction scheme based on the Weisfeiler-Lehman test of isomorphism on graphs. It maps the original graph to a sequence of graphs, whose node attributes capture topological and label information. A fa...更多

代码

数据

下载 PDF 全文
引用
您的评分 :
0

 

标签
评论