Weisfeiler-Lehman Graph Kernels

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

    Cited by: 478|Bibtex|Views12|Links
    EI
    Keywords:
    weisfeiler-lehman graph kernelsgraph kernelgraph classification benchmark datadiscrete node labeloriginal graphMore(6+)

    Abstract:

    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...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments