Weisfeiler-Lehman Graph Kernels
Journal of Machine Learning Research, pp. 2539-2561, 2011.
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 全文