Polynomial-time max-product algorithms for exact (neuron-level) and approximate (node-level) top-K relevant walk search in GNN-LRP explanations.
Huang and Nikhil Rao and Karthik Subbian and Shuiwang Ji , title =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Relevant Walk Search for Explaining Graph Neural Networks
Polynomial-time max-product algorithms for exact (neuron-level) and approximate (node-level) top-K relevant walk search in GNN-LRP explanations.