Сравнение на методи

	Бейсовско откриване на общности	Анализ на модулността
Област	Мрежови анализ	Мрежови анализ
Семейство	Machine learning	Machine learning
Година на възникване	2001–2014	2004
Създател	Nowicki, K. & Snijders, T. A. B. (formal Bayesian framing); extended by Peixoto, T. P.	Newman, M. E. J. & Girvan, M.
Тип	Probabilistic generative model / inference	Community detection / graph partitioning
Основополагащ източник	Peixoto, T. P. (2014). Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Physical Review E, 89(1), 012804.	Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113.
Други названия	Bayesian graph clustering, probabilistic community detection, Bayesian stochastic block model community detection, Bayesian network partitioning	Q-modularity, community structure detection, network modularity optimization, graph partitioning by modularity
Свързани	5	5
Резюме	Bayesian community detection infers latent group structure in networks by treating community membership as unobserved variables and using Bayesian inference — typically via Markov chain Monte Carlo or variational methods — to compute a posterior distribution over all plausible partitions. Unlike modularity optimisation, it selects the number of communities from data and provides principled uncertainty estimates for every node assignment.	Modularity analysis is a network science method, formalized by Newman and Girvan in 2004, that detects community structure in graphs by measuring whether edges are more concentrated within groups than expected by chance. Its scalar quality index Q guides algorithms that partition nodes into cohesive clusters, making it the most widely adopted framework for community detection in social, biological, and technological networks.