Return
Modularity for hypergraph clustering: Methodologies and applications
DOI:10.1016/j.omega.2025.103387.png)
Abstract
En 中文
• To introduce a new definition of modularity that can be applied to hypergraphs. • To propose an optimization model based on mathematical programming to find the optimal hypergraph partition. • To compare its result with the outcome of other models suggested so far, and finding that they are an improvement. • To show that hypergraph clustering can be applied to survey data, to carry on statistical analysis otherwise not available.
Keywords:
Complex networks
Hypergraph clustering
Modularity
Mathematical programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
0
Papers:
170
Citations:
0

