ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Κεντρικότητα Εγγύτητας×Ανάλυση Κοινωνικών Δικτύων×
ΠεδίοΑνάλυση ΔικτύωνΑνάλυση Δικτύων
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης1950 (formalized 1979)1934 (sociometry); 1994 (modern formalization)
ΔημιουργόςBavelas, A.; formalized by Freeman, L. C.Moreno, J.L.; formalized by Wasserman & Faust
ΤύποςNode-level centrality indexStructural/relational analysis framework
Θεμελιώδης πηγήFreeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1
Εναλλακτικές ονομασίεςcloseness, farness-based centrality, geodesic closeness, normalized closeness centralitySNA, network analysis, sociometric analysis, relational analysis
Συναφείς65
ΣύνοψηCloseness centrality measures how quickly a node can reach all others in a network by computing the inverse of its average shortest-path distance to every other node. First described by Bavelas (1950) and formally unified by Freeman (1979), it identifies nodes that can spread information or resources efficiently across the entire graph — not merely nodes with many direct contacts.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.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Closeness Centrality · Social Network Analysis. Ανακτήθηκε στις 2026-06-19 από https://scholargate.app/el/compare