New for: D3
counting particular types of subgraphs ignore the relative position of
these subgraphs to each other, while graph kernels based on algebraic
methods are limited to graphs without node labels.
In this work we present the graphlet spectrum, a system of graph
invariants derived by means of group representation theory that capture
information about the number as well as the position of labeled
subgraphs in a given graph. In our experimental evaluation the graphlet
spectrum outperforms several state-of-the-art graph kernels in accuracy.