Hi i was reading a paper "Propagating Distributions on a Hypergraph by Dual Information Regularization by Koji Tsuda", and one section stood out to me.
hypergraphs have more flexibility in describing prior knowledge, because known clusters can be directly encoded as hyperedges. It might be possible to convert a hypergraph to a conventional graph, for example, by converting a hyperedge to a complete subgraph.
My question is how exactly can one encode a small cluster into a hyperedge and how can one go in reverse. I've tried googling it but I've come up short.