Community detection in hypergraphs via mutual information maximization

Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and community-edge intersections. This alg...

Descripción completa

Detalles Bibliográficos
Autores principales: Jürgen Kritschgau, Daniel Kaiser, Oliver Alvarado Rodriguez, Ilya Amburg, Jessalyn Bolkema, Thomas Grubb, Fangfei Lan, Sepideh Maleki, Phil Chodrow, Bill Kay
Formato: Artículo
Lenguaje:English
Publicado: Nature Portfolio 2024-03-01
Colección:Scientific Reports
Acceso en línea:https://doi.org/10.1038/s41598-024-55934-5