Maximal hypercliques search based on concept-cognitive learning

Published: 01 Jan 2025, Last Modified: 14 May 2025Int. J. Approx. Reason. 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
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