atlas

Research map / Graph learning / Graph algorithms and clustering

RetGK: Graph Kernels based on Return Probabilities of Random Walks

NeurIPS 2018 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 37 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use return-probability node features with RetGK_I rather than WLGraph classification · COLLABaccuracy: 74.8(0.2) -> 81.0(0.3)Helped
Use approximate tensor embeddings (RetGK_II) rather than the Hilbert-space kernel (RetGK_I) (ablation)RetGK · COLLABaccuracy: 81.0(0.3) -> 80.6(0.3)No clear effect
Use Monte Carlo return-probability estimates rather than exact features (ablation)RetGK_II · REDDIT-BINARYaccuracy: 91.6(0.2) -> 90.8(0.2)Hurt
Use Monte Carlo return-probability estimates for kernel computation (ablation)RetGK_II · Non-attributed graph datasets (total time)runtime: 17m14s -> 6m9sHelped
Use RetGK_II instead of the strongest reported baselineGraph classification · Synthieaccuracy: 80.3(1.4) -> 96.2(0.3)Helped
Use RetGK_II rather than RetGK_I (ablation)RetGK · BZRaccuracy: 86.4(1.2) -> 87.1(0.7)No clear effect
Use RetGK_II rather than RetGK_I (ablation)RetGK · PROTEINS with both discrete and continuous attributesaccuracy: 78.0(0.3) -> 77.3(0.5)Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy