Association graphs represent a classical tool to deal with the graph matching problem and recently the idea has been generalized to the case of hypergraphs. In this article, the potential of this approach is explored. The proposed framework uses a class of dynamical systems derived from the Baum-Eagon inequality in order to find the maximum (maximal) clique in the association hypergraph, that corresponds to the maximum (maximal) isomorphism between the hypergraphs to be matched. The proposed approach has extensively been tested with experiments on a large synthetic dataset, including hypergraphs of different cardinalities, order and connectivities. In particular the isomorphism version of the problem has been analyzed. The results obtained are impressive in terms of correctness, thus showing that, despite its simplicity, the Baum-Eagon dynamics has an outstanding capacity of finding globally optimal solutions and solving the hypergraph isomorphism problem.

Association graphs represent a classical tool to deal with the graph matching problem and recently the idea has been generalized to the case of hypergraphs. In this article, the potential of this approach is explored. The proposed framework uses a class of dynamical systems derived from the Baum-Eagon inequality in order to find the maximum (maximal) clique in the association hypergraph, that corresponds to the maximum (maximal) isomorphism between the hypergraphs to be matched. The proposed approach has extensively been tested with experiments on a large synthetic dataset, including hypergraphs of different cardinalities, order and connectivities. In particular the isomorphism version of the problem has been analyzed. The results obtained are impressive in terms of correctness, thus showing that, despite its simplicity, the Baum-Eagon dynamics has an outstanding capacity of finding globally optimal solutions and solving the hypergraph isomorphism problem. (C) 2019 Elsevier B.V. All rights reserved.

Hypergraph Isomorphism Using Association Hypergraphs

Giulia Sandi
;
Sebastiano Vascon;Marcello Pelillo
2019-01-01

Abstract

Association graphs represent a classical tool to deal with the graph matching problem and recently the idea has been generalized to the case of hypergraphs. In this article, the potential of this approach is explored. The proposed framework uses a class of dynamical systems derived from the Baum-Eagon inequality in order to find the maximum (maximal) clique in the association hypergraph, that corresponds to the maximum (maximal) isomorphism between the hypergraphs to be matched. The proposed approach has extensively been tested with experiments on a large synthetic dataset, including hypergraphs of different cardinalities, order and connectivities. In particular the isomorphism version of the problem has been analyzed. The results obtained are impressive in terms of correctness, thus showing that, despite its simplicity, the Baum-Eagon dynamics has an outstanding capacity of finding globally optimal solutions and solving the hypergraph isomorphism problem. (C) 2019 Elsevier B.V. All rights reserved.
File in questo prodotto:
File Dimensione Formato  
prl_hypergraph.pdf

non disponibili

Tipologia: Versione dell'editore
Licenza: Accesso chiuso-personale
Dimensione 1.12 MB
Formato Adobe PDF
1.12 MB Adobe PDF   Visualizza/Apri
Hypergraph_matching_PRL__Copy_.pdf

Open Access dal 25/09/2021

Descrizione: Post-Print
Tipologia: Documento in Post-print
Licenza: Creative commons
Dimensione 569.84 kB
Formato Adobe PDF
569.84 kB Adobe PDF Visualizza/Apri

I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10278/3718998
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 5
social impact