Computing Graph Edit Distance via Neural Graph Matching

Computer Science

• Machine Learning 100%
• Learning System 100%
• Graph Matching 100%
• Graph Neural Network 100%
• Mean Absolute Error 100%
• Similarity Score 100%
• Learning Framework 50%
• Deep Learning Method 50%
• Searching Algorithm 50%
• Greedy Algorithm 50%
• Interpretability 50%
• bipartite matching 50%
• Postprocessing 50%
• Processing Algorithm 50%
• Graph Theory 50%
• Regression Task 50%
• Prediction Value 50%
• Primitive Operation 50%

Keyphrases

• Graph Edit Distance 100%
• Neural Graph Matching 100%
• Distance Parameter 33%
• Best Matches 22%
• Suboptimal Solutions 22%
• Machine Learning Models 22%
• Distance Computation 22%
• Mean Absolute Error 22%
• Graph Neural Network 22%
• Similarity Score 22%
• Matching Matrix 22%
• Minimum number 11%
• Deep Learning Framework 11%
• Greedy Algorithm 11%
• Search Methods 11%
• Graph Structure 11%
• Search Algorithm 11%
• NP-hardness 11%
• Classical Algorithm 11%
• Graph Theory 11%
• Value-based 11%
• Bipartite Matching 11%
• Numerical Precision 11%
• Post-processing Algorithm 11%
• NP-hard Problem 11%
• Inexact Algorithm 11%
• Distance Problems 11%
• Node Matching 11%
• Regression Task 11%
• Value Prediction 11%
• Beam Search Algorithm 11%
• Operation Sequence 11%
• Power-law Graphs 11%
• Intrinsic Complexity 11%
• K-best 11%
• Primitive Operation 11%

Engineering

• Distance Value 100%
• Learning System 66%
• Similarity 66%
• Mean Absolute Error 66%
• Deep Learning Method 33%
• Greedy Algorithm 33%
• Nodes 33%
• Search Algorithm 33%
• Processing Algorithm 33%
• Primitive Operation 33%