Association graph techniques represent a classical approach to tackle the graph matching problem and recently the idea has been generalized to the case of hypergraphs. In this paper, we explore the potential of this approach in conjunction with a class of dynamical systems derived from the Baum-Eagon inequality. In particular, we focus on the pure isomorphism case and show, with extensive experiments on a large synthetic dataset, that despite its simplicity the Baum-Eagon dynamics does an excellent job at finding globally optimal solutions.
|Titolo:||On association graph techniques for hypergraph matching|
SANDI, GIULIA (Corresponding)
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|
File in questo prodotto:
|association-graph-techniques.pdf||Conference Paper||Documento in Post-print||Accesso chiuso-personale||Riservato|