Cover Image

Computing Approximate Graph Edit Distance via Optimal Transport

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cheng, Qihao, Yan, Da, Wu, Tianhao, Huang, Zhongyi, Zhang, Qin
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

GEDAN: Learning the Edit Costs for Graph Edit Distance
by: Leonardi, Francesco, et al.
Published: (2025)

Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN
by: Huang, Wei, et al.
Published: (2025)

Graph Edit Distance with General Costs Using Neural Set Divergence
by: Jain, Eeshaan, et al.
Published: (2024)

GraphEdit: Large Language Models for Graph Structure Learning
by: Guo, Zirui, et al.
Published: (2024)

Lightspeed Geometric Dataset Distance via Sliced Optimal Transport
by: Nguyen, Khai, et al.
Published: (2025)

Arbitrary Time Information Modeling via Polynomial Approximation for Temporal Knowledge Graph Embedding
by: Fang, Zhiyu, et al.
Published: (2024)

Edit Distance Robust Watermarks via Indexing Pseudorandom Codes
by: Golowich, Noah, et al.
Published: (2024)

EPIC: Graph Augmentation with Edit Path Interpolation via Learnable Cost
by: Heo, Jaeseung, et al.
Published: (2023)

Improving Molecular Graph Generation with Flow Matching and Optimal Transport
by: Hou, Xiaoyang, et al.
Published: (2024)

Generalized Tree Edit Distance (GTED): A Faithful Evaluation Metric for Statement Autoformalization
by: Liu, Yuntian, et al.
Published: (2025)

SGFormer: Single-Layer Graph Transformers with Approximation-Free Linear Complexity
by: Wu, Qitian, et al.
Published: (2024)

Graph Edits for Counterfactual Explanations: A comparative study
by: Dimitriou, Angeliki, et al.
Published: (2024)

Counterfactual Identifiability via Dynamic Optimal Transport
by: Ribeiro, Fabio De Sousa, et al.
Published: (2025)

Conflict-Aware Pseudo Labeling via Optimal Transport for Entity Alignment
by: Ding, Qijie, et al.
Published: (2022)

Orthogonal Factor-Based Biclustering Algorithm (BCBOF) for High-Dimensional Data and Its Application in Stock Trend Prediction
by: Huang, Yan, et al.
Published: (2025)

Edit Flows: Flow Matching with Edit Operations
by: Havasi, Marton, et al.
Published: (2025)

Displacement-Sparse Neural Optimal Transport
by: Chen, Peter, et al.
Published: (2025)

Score-Based Diffusion Policy Compatible with Reinforcement Learning via Optimal Transport
by: Sun, Mingyang, et al.
Published: (2025)

Influence Functions for Edge Edits in Non-Convex Graph Neural Networks
by: Heo, Jaeseung, et al.
Published: (2025)

Faithful Interpretation for Graph Neural Networks
by: Hu, Lijie, et al.
Published: (2024)

Supervised Distributional Reduction via Optimal Transport and Dependence Maximization
by: Ramesh, Sai-Aakash, et al.
Published: (2026)

STTS-EAD: Improving Spatio-Temporal Learning Based Time Series Prediction via
by: Liang, Yuanyuan, et al.
Published: (2025)

TAMI: Taming Heterogeneity in Temporal Interactions for Temporal Graph Link Prediction
by: Yu, Zhongyi, et al.
Published: (2025)

Robot Policy Learning with Temporal Optimal Transport Reward
by: Fu, Yuwei, et al.
Published: (2024)

Learning to Approximate Adaptive Kernel Convolution on Graphs
by: Sim, Jaeyoon, et al.
Published: (2024)

Solving Prior Distribution Mismatch in Diffusion Models via Optimal Transport
by: Wang, Zhanpeng, et al.
Published: (2024)

Align Your Intents: Offline Imitation Learning via Optimal Transport
by: Bobrin, Maksim, et al.
Published: (2024)

Reliable Modeling of Distribution Shifts via Displacement-Reshaped Optimal Transport
by: Naumann, Philip, et al.
Published: (2026)

PLOT: Progressive Localization via Optimal Transport in Neural Causal Abstraction
by: Chang, Jonathn, et al.
Published: (2026)

DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching
by: Huang, Wei, et al.
Published: (2025)

Cross-Domain Imitation Learning via Optimal Transport
by: Fickinger, Arnaud, et al.
Published: (2021)

Unbiased Online Curvature Approximation for Regularized Graph Continual Learning
by: Yin, Jie, et al.
Published: (2025)

Vine Copulas as Differentiable Computational Graphs
by: Cheng, Tuoyuan, et al.
Published: (2025)

How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern Comprehension
by: Dai, Xinnan, et al.
Published: (2024)

Hierarchical Multi-Marginal Optimal Transport for Network Alignment
by: Zeng, Zhichen, et al.
Published: (2023)

Learning from Noisy Labels for Long-tailed Data via Optimal Transport
by: Li, Mengting, et al.
Published: (2024)

APLOT: Robust Reward Modeling via Adaptive Preference Learning with Optimal Transport
by: Li, Zhuo, et al.
Published: (2025)

Distributional Counterfactual Explanations With Optimal Transport
by: You, Lei, et al.
Published: (2024)

Private Wasserstein Distance
by: Li, Wenqian, et al.
Published: (2024)

GraphRARE: Reinforcement Learning Enhanced Graph Neural Network with Relative Entropy
by: Peng, Tianhao, et al.
Published: (2023)