graphlet kernels for large graph comparison

    Cited by: 0|Bibtex|Views9|

    Abstract:

    State-of-the-art graph kernels do not scale to large graphs with hundreds of nodes and thousands of edges. In this article we propose to compare graphs by counting graphlets, i.e., subgraphs with k nodes where k2 f3; 4; 5g. Exhaustive enumeration of all graphlets be- ing prohibitively expensive, we introduce two theoretically grounded spe...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments