Finding Bipartite Components in Hypergraphs

Peter Macgregor, He Sun

Keywords: hypergraph clustering, spectral methods

TL;DR: In this work we study a new heat diffusion process in hypergraphs, and design a polynomial-time algorithm that approximately finds bipartite components in a hypergraph.

Abstract: Hypergraphs are important objects to model ternary or higher-order relations of objects, and have a number of applications in analysing many complex datasets occurring in practice. In this work we study a new heat diffusion process in hypergraphs, and employ this process to design a polynomial-time algorithm that approximately finds bipartite components in a hypergraph. We theoretically prove the performance of our proposed algorithm, and compare it against the previous state-of-the-art through extensive experimental analysis on both synthetic and real-world datasets. We find that our new algorithm consistently and significantly outperforms the previous state-of-the-art across a wide range of hypergraphs.

Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.

Code: https://github.com/pmacg/hypergraph-bipartite-components

Community Implementations: [ 1 code implementation](https://www.catalyzex.com/paper/finding-bipartite-components-in-hypergraphs/code)