Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Ανάλυση Κοινωνικών Δικτύων× | Κεντρικότητα Βαθμού× | |
|---|---|---|
| Πεδίο | Ανάλυση Δικτύων | Ανάλυση Δικτύων |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 1934 (sociometry); 1994 (modern formalization) | 1978 |
| Δημιουργός≠ | Moreno, J.L.; formalized by Wasserman & Faust | Freeman, L. C. |
| Τύπος≠ | Structural/relational analysis framework | Node-level centrality measure |
| Θεμελιώδης πηγή≠ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| Εναλλακτικές ονομασίες | SNA, network analysis, sociometric analysis, relational analysis | node degree, degree score, DC, connectivity centrality |
| Συναφείς≠ | 5 | 6 |
| Σύνοψη≠ | Social Network Analysis (SNA) is a structural method that maps and measures relationships and flows between people, groups, organizations, or other entities modeled as nodes connected by ties (edges). Rather than focusing on individual attributes, SNA reveals how the pattern of connections shapes behavior, influence, information flow, and outcomes within a system. | Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|