Work

Fast Neighborhood Subgraph Pairwise Distance Kernel

Year: 2010
Type: conference-paper
Abstract: We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius at increasing distances. We show that using a fast graph invariant we obtain significant speed-ups in the Gram matrix computation. Finally, we test the novel kernel on a wide range of chemoinformatics tasks, from antiviral to anticarcinogenic to toxicological activity prediction, and observe competitive performance when compared against several recent graph kernel methods. 1.
Source: Lirias
Institution: KU Leuven
Language: English
Subfield: Drug Discovery
Open Access status: green
OpenAlex ID: W2137476097
FWCI: 34.7
Cites: 19
Cited by: 318
Related to: 10