AIConfPaper
← Search

Saswat Meher

2 accepted papers

2025

Position: Graph Matching Systems Deserve Better Benchmarks

Indradyumna Roy, Saswat Meher, Eeshaan Jain, Soumen Chakrabarti, Abir De
ICML 2025poster

Data sets used in recent work on graph similarity scoring and matching tasks suffer from significant limitations. Using Graph Edit Distance (GED) as a showcase, we highlight pervasive issues such as train-test leakage and poor generalization, which have misguided the community's understanding and a…

Cited by 3Source ↗PDF ↗Scholar ↗
2024

Graph Edit Distance with General Costs Using Neural Set Divergence

Eeshaan Jain, Indradyumna Roy, Saswat Meher, Soumen Chakrabarti, Abir De
NeurIPS 2024poster

Graph Edit Distance (GED) measures the (dis-)similarity between two given graphs in terms of the minimum-cost edit sequence, which transforms one graph to the other. GED is related to other notions of graph similarity, such as graph and subgraph isomorphism, maximum common subgraph, etc. However, th…

Cited by 2Source ↗PDF ↗code ↗Scholar ↗