Machine learningNetwork science

Bayesian Community Detection

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.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Peixoto, T. P. (2014). Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Physical Review E, 89(1), 012804. DOI: 10.1103/PhysRevE.89.012804
  2. Nowicki, K. & Snijders, T. A. B. (2001). Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96(455), 1077–1087. DOI: 10.1198/016214501753208735

Related methods

Referenced by

ScholarGateBayesian Community Detection (Bayesian Community Detection in Networks). Retrieved 2026-06-04 from https://scholargate.app/tr/network-analysis/bayesian-community-detection