GNA predicts GED and produces hard one-to-one node alignments via an unsupervised Gumbel-Sinkhorn module, outperforming prior soft-alignment models on three datasets.
Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern recognition letters 18 (8) (1997) 689–694
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Graph Similarity Computation via Interpretable Neural Node Alignment
GNA predicts GED and produces hard one-to-one node alignments via an unsupervised Gumbel-Sinkhorn module, outperforming prior soft-alignment models on three datasets.