Stitching several short random walks into a product of unbiased feature matrices approximates graph node kernels with less variance and better long-range coverage than single long walks.
Graph kernels: A survey
1 Pith paper cite this work, alongside 85 external citations. Polarity classification is still indexing.
1
Pith paper citing it
85
external citations · OpenAlex
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computationally-efficient Graph Modeling with Refined Graph Random Features
Stitching several short random walks into a product of unbiased feature matrices approximates graph node kernels with less variance and better long-range coverage than single long walks.