Mathematical morphology on hypergraphs, application to similarity and positive kernel

The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion.

► Define complete lattices on hypergraphs.
► Define mathematical morphology operators on hypergraphs.
► Relations with duality notions.
► Similarity, kernel and metric on hypergraphs based on dilation.