مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| مرکزیت نزدیکی وزندار× | مرکزیت نزدیکی× | |
|---|---|---|
| حوزه | تحلیل شبکه | تحلیل شبکه |
| خانواده | Machine learning | Machine learning |
| سال پیدایش≠ | 2010 | 1950 (formalized 1979) |
| پدیدآور≠ | Opsahl, T.; Agneessens, F.; Skvoretz, J. | Bavelas, A.; formalized by Freeman, L. C. |
| نوع≠ | Centrality measure (network analysis) | Node-level centrality index |
| منبع بنیادین≠ | Opsahl, T., Agneessens, F. & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI ↗ | Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| نامهای دیگر | weighted closeness, generalized closeness centrality, WCC, distance-weighted closeness | closeness, farness-based centrality, geodesic closeness, normalized closeness centrality |
| مرتبط | 6 | 6 |
| خلاصه≠ | Weighted closeness centrality extends the classic closeness measure to networks where edges carry numerical weights — such as frequency, strength, or cost — by incorporating those weights into shortest-path distances. Nodes that can reach others quickly along strong or efficient connections receive higher scores, making it a richer indicator of information-spreading potential than its binary counterpart. | 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. |
| ScholarGateمجموعهداده ↗ |
|
|