Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| Modularity Analysis× | Twee-modenetwerkanalyse× | |
|---|---|---|
| Vakgebied | Netwerkanalyse | Netwerkanalyse |
| Familie | Machine learning | Machine learning |
| Jaar van ontstaan≠ | 2004 | 1974 |
| Grondlegger≠ | Newman, M. E. J. & Girvan, M. | Breiger, R. L. |
| Type≠ | Community detection / graph partitioning | Bipartite graph analysis |
| Oorspronkelijke bron≠ | Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. DOI ↗ | Breiger, R. L. (1974). The duality of persons and groups. Social Forces, 53(2), 181–190. DOI ↗ |
| Aliassen | Q-modularity, community structure detection, network modularity optimization, graph partitioning by modularity | bipartite network analysis, affiliation network analysis, two-mode SNA, dual-projection network analysis |
| Verwant | 5 | 5 |
| Samenvatting≠ | Modularity analysis is a network science method, formalized by Newman and Girvan in 2004, that detects community structure in graphs by measuring whether edges are more concentrated within groups than expected by chance. Its scalar quality index Q guides algorithms that partition nodes into cohesive clusters, making it the most widely adopted framework for community detection in social, biological, and technological networks. | 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. |
| ScholarGateGegevensset ↗ |
|
|