<ul><li>Graph Edit Distance (GED) is an important similarity measure in graph retrieval, allowing customizable operation costs.</li><li>A new approach called Graph Edit Network (GEN) is introduced to address the limitations of existing methods.</li><li>GEN incorporates operation costs in determining optimal graph mappings and proactively optimizes guidance from a graph perspective.</li><li>Results show that GEN outperforms state-of-the-art models in terms of error reduction and inference time reduction.</li></ul>

Flexible Graph Similarity Computation With A Proactive Optimization Strategy

Discover more