AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Graph Matching via Multiplicative Update Algorithm

Bo Jiang, Jin Tang, Chris Ding, Yihong Gong, Bin Luo

NeurIPS 2017 · Graph learning › Graph algorithms and clustering · approach: Optimization algorithms for graph matching · 19 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use MPGM instead of IPFP and FGMsynthetic point-set graph matching · Synthetic 2D point matchingobjective score and accuracyImproved
use MPGM instead of SM, SMAC, RRWMsynthetic point-set graph matching · Synthetic 2D point matchingobjective score and accuracyImproved
use MPGM instead of competing methodsfeature matching · CMU and YORK house sequencesobjective score and accuracyImproved
use MPGM instead of RRWM and FGMreal image matching with outliers · Pascal 2007 cars and motorbikesmatching accuracyImproved
MPGM vs RRWM runtimesynthetic point-set graph matching · Synthetic 2D point matchingtime costNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy