Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| Bipartiete Netwerkanalyse× | Community Detection× | |
|---|---|---|
| Vakgebied | Netwerkanalyse | Netwerkanalyse |
| Familie | Process / pipeline | Process / pipeline |
| Jaar van ontstaan≠ | 1997 | 2002–2019 (algorithm family) |
| Grondlegger≠ | Borgatti & Everett (1997) formalised the two-mode network framework | Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008) |
| Type≠ | Graph-structural / relational analysis | Graph-partitioning / clustering algorithm family |
| Oorspronkelijke bron≠ | Borgatti, S.P. & Everett, M.G. (1997). Network Analysis of 2-Mode Data. Social Networks, 19(3), 243-269. link ↗ | 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 | two-mode network analysis, affiliation network analysis, İki Modlu Ağ Analizi (Bipartite Networks) | graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden) |
| Verwant | 5 | 5 |
| Samenvatting≠ | Bipartite network analysis, formalised by Borgatti and Everett in 1997, is a graph-structural method for studying networks in which nodes are divided into two disjoint sets — actors and events — and edges exist only between sets, never within them. It is the natural framework for author–paper, patient–disease, user–product, and any other affiliation data, and it extends one-mode network analysis by providing metrics and projection techniques tailored to the two-mode structure. | 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 ↗ |
|
|