Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Comparison of modularity-based approaches for nodes clustering in hypergraphs (2401.14028v2)

Published 25 Jan 2024 in cs.SI, math.CO, physics.data-an, and stat.AP

Abstract: Statistical analysis and node clustering in hypergraphs constitute an emerging topic suffering from a lack of standardization. In contrast to the case of graphs, the concept of nodes' community in hypergraphs is not unique and encompasses various distinct situations. In this work, we conducted a comparative analysis of the performance of modularity-based methods for clustering nodes in binary hypergraphs. To address this, we begin by presenting, within a unified framework, the various hypergraph modularity criteria proposed in the literature, emphasizing their differences and respective focuses. Subsequently, we provide an overview of the state-of-the-art codes available to maximize hypergraph modularities for detecting node communities in binary hypergraphs. Through exploration of various simulation settings with controlled ground truth clustering, we offer a comparison of these methods using different quality measures, including true clustering recovery, running time, (local) maximization of the objective, and the number of clusters detected. Our contribution marks the first attempt to clarify the advantages and drawbacks of these newly available methods. This effort lays the foundation for a better understanding of the primary objectives of modularity-based node clustering methods for binary hypergraphs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. Spectral detection on sparse hypergraphs. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.  66–73.
  2. Networks beyond pairwise interactions: Structure and dynamics. Phys Rep 874, 1–92.
  3. What are higher-order networks? SIAM Review 65(3), 686–731.
  4. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008(10), P10008.
  5. Model-based clustering in simple hypergraphs through a stochastic blockmodel. Technical report, arXiv:2210.05983.
  6. HyperSBM: Stochastic blockmodel for hypergraphs. R package, https://github.com/LB1304/HyperSBM.
  7. Loops and multiple edges in modularity maximization of networks. Phys Rev E 81, 046102.
  8. High-order correlations explain the collective behavior of cortical populations in executive, but not sensory areas. Neuron 109(24), 3954–3961.
  9. On the minimax misclassification ratio of hypergraph community detection. IEEE Transactions on Information Theory 65(12), 8095–8118.
  10. Nonbacktracking spectral clustering of nonuniform hypergraphs. SIAM Journal on Mathematics of Data Science 5(2), 251–279.
  11. Generative hypergraph clustering: From blockmodels to modularity. Science Advances 7(28), eabh1303.
  12. HyperModularity. Julia package, https://github.com/nveldt/HyperModularity.jl.
  13. Connected components in random graphs with given expected degree sequences. Annals of Combinatorics 6, 125–145.
  14. Finding community structure in very large networks. Physical Review E 70(6), 066111.
  15. Chapter 13 - generalized topologies: Hypergraphs, chemical reactions, and biological evolution. In S. C. Basak, G. Restrepo, and J. L. Villaveces (Eds.), Advances in Mathematical Chemistry and Applications, pp.  300–328. Bentham Science Publishers.
  16. Consistency of spectral hypergraph partitioning under planted partition model. Ann Statist 45(1), 289 – 315.
  17. Comparing partitions. J Classif 2(1), 193–218.
  18. Community detection algorithm using hypergraph modularity. In R. M. Benito, C. Cherifi, H. Cherifi, E. Moro, L. M. Rocha, and M. Sales-Pardo (Eds.), Complex Networks & Their Applications IX, pp.  152–163.
  19. Clustering via hypergraph modularity. PLoS ONE 14(11), e0224307.
  20. Clustering via hypergraph modularity - Companion source code and files. Python code, https://gist.github.com/pszufe.
  21. Artificial Benchmark for Hypergraphs Community Detection (ABCDH) - A Random Hypergraph Model with Community Structure. Julia code, https://github.com/bkamins/ABCDHypergraphGenerator.jl.
  22. Hypergraph Artificial Benchmark for Community Detection (h–ABCD). Journal of Complex Networks 11(4), cnad028.
  23. Hypergraph clustering by iteratively reweighted modularity maximization. Appl. Netw. Sci. 5(1), 52.
  24. Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78, 046110.
  25. How do hyperedges overlap in real-world hypergraphs? - patterns, measures, and generators. In Proceedings of the Web Conference 2021, WWW ’21, New York, NY, USA, pp.  3396–3407. Association for Computing Machinery.
  26. Massen, C. P. and J. P. K. Doye (2005). Identifying communities within energy landscapes. Phys Rev E 71, 046101.
  27. Non-king elimination, intransitive triad interactions, and species coexistence in ecological competition networks. Theor Ecol 13, 385–397.
  28. Newman, M. E. J. (2016). Equivalence between modularity optimization and maximum likelihood methods for community detection. Phys. Rev. E 94, 052315.
  29. Newman, M. E. J. and M. Girvan (2004). Finding and evaluating community structure in networks. Physical Review E 69(2), 026113.
  30. Model-based clustering for random hypergraphs. Adv Data Anal Classif 16, 691–723.
  31. PNNL, L. (2023). HyperNetX. Python library (v2.0.3), https://pnnl.github.io/HyperNetX/index.html.
  32. Measuring network centrality using hypergraphs. In Proceedings of the Second ACM IKDD Conference on Data Sciences, CoDS ’15, pp.  59–68.
  33. Community detection in large hypergraphs. Science Advances 9(28), eadg9159.
  34. Simmel, G. (1950). The sociology of Georg Simmel. The free press, New York.
  35. Analytical maximum-likelihood method to detect patterns in real networks. New J Phys 13(8), 083001.
  36. Sparse random hypergraphs: Non-backtracking spectra and community detection. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp.  567–575.
  37. The why, how, and when of representations for complex systems. SIAM Rev 63(3), 435–485.
  38. A comparative analysis of community detection algorithms on artificial networks. Sci Rep 6, 30750.
  39. Zhang, Q. and V. Y. F. Tan (2023). Exact recovery in the general hypergraph stochastic block model. IEEE Trans Inf Theory 69(1), 453–471.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now