Assume a network with \( N \) nodes. Each node \(i\) has a hidden label \(t_i \in \{1, 2, \dots, q\} \).
Table of Contents
Mixed membership models #
A "mixed-membership" model assumes that each node may have multiple hidden labels (see Overlapping community structure).
References #
-
Community Detection and Stochastic Block Models - a review paper by Emmanuel Abbe
-
http://arxiv.org/abs/1008.3926 - Stochastic blockmodels and Community structure in networks
- http://arxiv.org/abs/1403.2933 - Efficiently inferring Bipartite community structure.
- Blockmodeling techniques for complex networks
- Efficient discovery of overlapping communities in massive networks - Paper/Gopalan2012community
Incoming Links #
Related Articles (Article 0) #
Related Scholarly Articles (ScholarlyArticle 1) #
Suggested Pages #
- 0.380 Affiliation graph model
- 0.094 Seed set expansion
- 0.076 Local community detection
- 0.074 Community validation
- 0.041 Cluster validation
- 0.037 Dynamic community structure
- 0.031 Community
- 0.023 Pajek
- 0.022 Prem Gopalan
- 0.021 David Blei
- More suggestions...