ScholarGate
Assistent
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.

Ava rakenduses MethodMindPeagiVideoPeagiDownload slides

Loe meetodi täielikku kirjeldust

Ainult liikmetele

Selle osa lugemiseks logi sisse tasuta kontoga.

Logi sisse

Method map

The neighbourhood of related methods — select a node to explore.

Allikad

  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

Kuidas sellele lehele viidata

ScholarGate. (2026, June 3). Bayesian Community Detection in Networks. ScholarGate. https://scholargate.app/et/network-analysis/bayesian-community-detection

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Sellele viitavad

ScholarGateBayesian Community Detection (Bayesian Community Detection in Networks). Loetud 2026-06-15 aadressilt https://scholargate.app/et/network-analysis/bayesian-community-detection · Andmestik: https://doi.org/10.5281/zenodo.20539026