Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| Twee-modenetwerkanalyse× | Community Detection× | |
|---|---|---|
| Vakgebied | Netwerkanalyse | Netwerkanalyse |
| Familie≠ | Machine learning | Process / pipeline |
| Jaar van ontstaan≠ | 1974 | 2002–2019 (algorithm family) |
| Grondlegger≠ | Breiger, R. L. | Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008) |
| Type≠ | Bipartite graph analysis | Graph-partitioning / clustering algorithm family |
| Oorspronkelijke bron≠ | Breiger, R. L. (1974). The duality of persons and groups. Social Forces, 53(2), 181–190. DOI ↗ | Blondel, V.D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. (2008). Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics, 2008(10), P10008. DOI ↗ |
| Aliassen≠ | bipartite network analysis, affiliation network analysis, two-mode SNA, dual-projection network analysis | graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden) |
| Verwant | 5 | 5 |
| Samenvatting≠ | Two-mode network analysis examines networks built from two distinct types of nodes — such as actors and events, authors and papers, or companies and board members — connected only across types. By analysing this bipartite structure directly or projecting it onto one-mode networks, researchers uncover affiliation patterns, shared memberships, and structural duality that are invisible in standard one-mode social network analysis. | Community detection is a family of graph-partitioning algorithms that discover densely connected sub-groups — communities — within a network. First formalised through the modularity measure by Girvan and Newman (2002), the field advanced rapidly with the Louvain method (Blondel et al., 2008), the Leiden refinement (Traag et al., 2019), and the information-theoretic Infomap approach. All variants answer the same question: which nodes cluster together more tightly among themselves than with the rest of the network? |
| ScholarGateGegevensset ↗ |
|
|