However, estimating the probabilities of rules extracted from hypergraphs is an NP-complete problem, which is computationally infeasible.
we propose a divide-and-conquer strategy by decomposing a hypergraph into a set of independent subhypergraphs.