Moreover, unidirectional clustering overlooks the mutual dependencies between rows and columns, making it difficult to optimize clustering performance. Therefore, this article proposes a novel general ...

A hypergraph is a generalization of a graph in that the restriction of pairwise affinity scores is lifted in favor of affinity scores that can be evaluated between an arbitrary number of inputs.