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.
Autori: | ||
Data di pubblicazione: | 2018 | |
Titolo: | On association graph techniques for hypergraph matching | |
Titolo del libro: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/978-3-319-97785-0_46 | |
Appare nelle tipologie: | 4.1 Articolo in Atti di convegno |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
association-graph-techniques.pdf | Conference Paper | Documento in Post-print | Accesso chiuso-personale | Riservato |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.