Abstract: Highlights•Comprehensive theoretical analysis of the problem of mining maximal cliques in hypergraphs.•Experimental study on identifying maximal hypercliques.•An efficient search algorithm for maximal hypercliques based on conceptual cognitive learning is proposed.
Loading