Before revision:  While many probabilistic generative models for graph clustering have been proposed , there are relatively few such models for hypergraphs.
After revision:  Many graph algorithms for this task are based on variants of the stochastic blockmodel, a random graph with flexible cluster structure. However , there are relatively few such models for hypergraphs.