Browse State-of-the-Art › Graph Similarity
Graph Similarity
51 papers with code · 1 benchmark · 3 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| IMDb (1 row) | SimGNN | SimGNN: A Neural Network Approach to Fast Graph Similarity Computation | code | Syntology 0 ran · 1 unverified | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
3 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 113 · with a code link: 51 · where Syntology ran a sample: 10 (10 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (10 of 113 tagged: 10 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 2: papers 1 to 100 of 113, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
16 Mar 2020 4 repositories listed Syntology official (archive's flag): 1 ran · 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples) · 1 pointer-only (licence)Accurate segmentation of tubular, network-like structures, such as vessels, neurons, or roads, is relevant to many fields of research.
-
Our model achieves better generalization on unseen graphs, and in the worst case runs in quadratic time with respect to the number of nodes in two graphs.
-
7 Mar 2017 3 repositories listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 9 harvested samples)Evaluating similarity between graphs is of major importance in several computer vision and pattern recognition problems, where graph representations are often used to model objects or interactions between elements.
-
24 Dec 2021 2 repositories listed Syntology official (archive's flag): 6 ran · 6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified (of 15 harvested samples)To elaborate, although GED is a metric, its neural approximations do not provide such a guarantee.
-
21 May 2025 1 repository listedDespite the dominance of convolutional and transformer-based architectures in image-to-image retrieval, these models are prone to biases arising from low-level visual features, such as color.
-
11 Mar 2025 1 repository listedGraph similarity learning (GSL), also referred to as graph matching in many scenarios, is a fundamental problem in computer vision, pattern recognition, and graph learning.
-
3 Mar 2025 1 repository listed Syntology official (archive's flag): 5 ran · 5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 5 harvested samples) · 5 pointer-only (licence)This results in an expressive, scalar, and application-agnostic measure of dynamic graph similarity that overcomes the limitations of traditional methods.
-
25 Feb 2025 1 repository listedBy merging the node sequences of graph pairs into a single large graph, our method leverages a global attention mechanism to facilitate interaction computations and to harvest cross-graph insights.
-
13 Dec 2024 1 repository listedIn GSC, graph edit distance (GED) and maximum common subgraph (MCS) are two important similarity metrics, both of which are NP-hard to compute.
-
10 Dec 2024 1 repository listed Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified (of 7 harvested samples)The expressive power of message-passing graph neural networks (MPNNs) is reasonably well understood, primarily through combinatorial techniques from graph isomorphism testing.
-
21 Jun 2024 1 repository listed Syntology official (archive's flag): 12 ran · 12 ran (of which 3 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified (of 16 harvested samples) · 16 pointer-only (licence)In the inference stage, the graph-level representations learned by the GNN encoder are directly used to compute the similarity score without using AReg again to speed up inference.
-
14 Mar 2024 1 repository listedSpecifically, we first construct the embedding feature tensor by stacking the embedding features of different views into a tensor and rotating it.
-
11 Mar 2024 1 repository listed Syntology official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified (of 11 harvested samples) · 11 pointer-only (licence)With a focus on the visual domain, we represent images as scene graphs and obtain their GNN embeddings to bypass solving the NP-hard graph similarity problem for all input pairs, an integral part of the CE computation…
-
1 Jan 2024 1 repository listedSpecifically we first construct the embedding feature tensor by stacking the embedding features of different views into a tensor and rotating it.
-
16 Dec 2023 1 repository listedA common tacit assumption is the KGE entity similarity assumption, which states that these KGEMs retain the graph's structure within their embedding space, i. e., position similar entities within the graph close to one…
-
4 Nov 2023 1 repository listedGraph Edit Distance (GED) is a general and domain-agnostic metric to measure graph similarity, widely used in graph search or retrieving tasks.
-
27 May 2023 1 repository listedTextual scene graph parsing has become increasingly important in various vision-language applications, including image caption evaluation and image retrieval.
-
9 May 2023 1 repository listedOur approach is evaluated on two historical datasets (Historical-WI and HisIR19).
-
21 Mar 2023 1 repository listedContext-free graph grammars have shown a remarkable ability to model structures in real-world relational data.
-
12 Mar 2023 1 repository listedWe propose HGSUM, an MDS model that extends an encoder-decoder architecture, to incorporate a heterogeneous graph to represent different semantic units (e. g., words and sentences) of the documents.
-
5 Jan 2023 1 repository listedTo reduce the interference of the noise during feature matching, we mainly focus on visible regions that appear in both images and develop a visibility graph to calculate the similarity.
-
4 Dec 2022 1 repository listedMotivated by this, we propose a joint graph learning method that takes into account the presence of hidden (latent) variables.
-
21 Oct 2022 1 repository listedTo develop effective and efficient graph similarity learning (GSL) models, a series of data-driven neural algorithms have been proposed in recent years.
-
16 Jun 2022 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample)In this paper, we compare methods using performance-based benchmarks such as linear evaluation, nearest neighbor classification, and clustering for several different datasets, demonstrating the lack of a clear…
-
30 May 2022 1 repository listedAs most of the existing graph neural networks yield effective graph representations of a single graph, little effort has been made for jointly learning two graph representations and calculating their similarity score.
-
29 Mar 2022 1 repository listedThe main novelty of our method is to use a siamese graph neural network architecture for learning a data-driven graph similarity function, which allows to effectively compare the current graph and its recent history.
-
4 Jan 2022 1 repository listedIn this work we propose new Weisfeiler-Leman AMR similarity metrics that unify the strengths of previous metrics, while mitigating their weaknesses.
-
16 Dec 2021 1 repository listedHence, this work proposes a new principle for unsupervised graph representation learning: Graph-wise Common latent Factor EXtraction (GCFX).
-
1 Dec 2021 1 repository listedFor slow learning of graph similarity, this paper proposes a novel early-fusion approach by designing a co-attention-based feature fusion network on multilevel GNN features.
-
19 Jun 2021 1 repository listedAccurate segmentation of tubular, network-like structures, such as vessels, neurons, or roads, is relevant to many fields of research.
-
18 Jun 2021 1 repository listed
-
29 Dec 2020 1 repository listed
-
26 Aug 2020 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 6 harvested samples)
-
26 Jul 2020 1 repository listed
-
8 Jul 2020 1 repository listed Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 6 harvested samples) · 3 pointer-only (licence)
-
31 May 2020 1 repository listed
-
23 Feb 2020 1 repository listed
-
1 Dec 2019 1 repository listed
-
6 Oct 2019 1 repository listed
-
21 Apr 2019 1 repository listed
-
1 Apr 2019 1 repository listed
-
11 Mar 2019 1 repository listed
-
28 Jan 2019 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified (of 10 harvested samples) · 4 pointer-only (licence)
-
1 Dec 2018 1 repository listed
-
23 Oct 2018 1 repository listed
-
10 Sep 2018 1 repository listed
-
7 Aug 2018 1 repository listed
-
30 May 2018 1 repository listed
-
25 May 2018 1 repository listed
-
23 Jan 2018 1 repository listed
-
1 Jun 2015 1 repository listed
-
Pieceformer: Similarity-Driven Knowledge Transfer via Scalable Graph Transformer in VLSI18 Jun 2025 0 repositories listed
-
Neural Graduated Assignment for Maximum Common Edge Subgraphs18 May 2025 0 repositories listed
-
PNE-SGAN: Probabilistic NDT-Enhanced Semantic Graph Attention Network for LiDAR Loop Closure Detection11 Apr 2025 0 repositories listed
-
Flexible Graph Similarity Computation With A Proactive Optimization Strategy9 Apr 2025 0 repositories listed
-
Point Cloud Objective Quality: Benchmarking Features and Quality Evaluation4 Apr 2025 0 repositories listed
-
Multi-Relation Graph-Kernel Strengthen Network for Graph-Level Clustering2 Apr 2025 0 repositories listed
-
From Text to Talent: A Pipeline for Extracting Insights from Candidate Profiles21 Mar 2025 0 repositories listed
-
Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks12 Mar 2025 0 repositories listed
-
Graph Neural Networks for Databases: A Survey18 Feb 2025 0 repositories listed
-
Circuit Diagram Retrieval Based on Hierarchical Circuit Graph Representation5 Feb 2025 0 repositories listed
-
A space-decoupling framework for optimization on bounded-rank matrices with orthogonally invariant constraints23 Jan 2025 0 repositories listed
-
SEGMN: A Structure-Enhanced Graph Matching Network for Graph Similarity Learning6 Nov 2024 0 repositories listed
-
PieClam: A Universal Graph Autoencoder Based on Overlapping Inclusive and Exclusive Communities18 Sep 2024 0 repositories listed
-
Multi-Domain Evolutionary Optimization of Network Structures21 Jun 2024 0 repositories listed
-
Exploring Weighted Property Approaches for RDF Graph Similarity Measure29 Apr 2024 0 repositories listed
-
Efficient Search in Graph Edit Distance: Metric Search Trees vs. Brute Force Verification15 Mar 2024 0 repositories listed
-
SALSA: Semantically-Aware Latent Space Autoencoder4 Oct 2023 0 repositories listed
-
Learning Deformable 3D Graph Similarity to Track Plant Cells in Unregistered Time Lapse Images20 Sep 2023 0 repositories listed
-
Graph Edit Distance Learning via Different Attention26 Aug 2023 0 repositories listed
-
Graph-Level Embedding for Time-Evolving Graphs1 Jun 2023 0 repositories listed
-
Bures-Wasserstein Means of Graphs31 May 2023 0 repositories listed
-
More Interpretable Graph Similarity Computation via Maximum Common Subgraph Inference9 Aug 2022 0 repositories listed
-
FlexiBERT: Are Current Transformer Architectures too Homogeneous and Rigid?23 May 2022 0 repositories listed
-
SPA-GCN: Efficient and Flexible GCN Accelerator with an Application for Graph Similarity Computation10 Nov 2021 0 repositories listed
-
26 Aug 2021 0 repositories listed
-
Graph Similarity Description: How Are These Graphs Similar?29 May 2021 0 repositories listed
-
Hierarchical Adaptive Pooling by Capturing High-order Dependency for Graph Representation Learning13 Apr 2021 0 repositories listed
-
An Empirical Study of the Expressiveness of Graph Kernels and Graph Neural Networks1 Jan 2021 0 repositories listed
-
Graph-Graph Similarity Network1 Jan 2021 0 repositories listed
-
Multi-level Graph Matching Networks for Deep and Robust Graph Similarity Learning1 Jan 2021 0 repositories listed
-
Some Algorithms on Exact, Approximate and Error-Tolerant Graph Matching30 Dec 2020 0 repositories listed
-
A graph similarity for deep learning1 Dec 2020 0 repositories listed
-
Node-Centric Graph Learning from Data for Brain State Identification4 Nov 2020 0 repositories listed
-
Learning Graph Edit Distance by Graph Neural Networks17 Aug 2020 0 repositories listed
-
NASGEM: Neural Architecture Search via Graph Embedding Method8 Jul 2020 0 repositories listed
-
Feedback Graph Attention Convolutional Network for Medical Image Enhancement24 Jun 2020 0 repositories listed
-
Visual-Semantic Matching by Exploring High-Order Attention and Distraction1 Jun 2020 0 repositories listed
-
Graph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation16 May 2020 0 repositories listed
-
CoSimGNN: Towards Large-scale Graph Similarity Computation14 May 2020 0 repositories listed
-
Inductive and Unsupervised Representation Learning on Graph Structured Objects1 May 2020 0 repositories listed
-
Fast and Scalable Complex Network Descriptor Using PageRank and Persistent Homology12 Feb 2020 0 repositories listed
-
Deep Graph Similarity Learning: A Survey25 Dec 2019 0 repositories listed
-
A Maximum Entropy approach to Massive Graph Spectra19 Dec 2019 0 repositories listed
-
Hierarchical Graph Matching Networks for Deep Graph Similarity Learning25 Sep 2019 0 repositories listed
-
8 Apr 2019 0 repositories listed
-
Understanding Neural Architecture Search Techniques31 Mar 2019 0 repositories listed
-
Similarity Learning with Higher-Order Graph Convolutions for Brain Network Analysis2 Nov 2018 0 repositories listed
-
On the Limitations of Unsupervised Bilingual Dictionary Induction9 May 2018 0 repositories listed
-
Graph Based Semi-Supervised Learning Approach for Tamil POS tagging1 May 2018 0 repositories listed
Syntology lines on 12 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections