ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

تحليل الشبكات الاجتماعية الموزونة×مركزية الدرجة×
المجالتحليل الشبكاتتحليل الشبكات
العائلةMachine learningMachine learning
سنة النشأة2004–20101978
صاحب الطريقةBarrat, A.; Opsahl, T. et al.Freeman, L. C.
النوعNetwork analysis frameworkNode-level centrality measure
المصدر التأسيسيBarrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. DOI ↗Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗
الأسماء البديلةWeighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysisnode degree, degree score, DC, connectivity centrality
ذات صلة66
الملخصWeighted Social Network Analysis extends classical SNA by assigning numeric values — weights — to ties between actors, capturing tie strength, interaction frequency, or resource flow. Rather than treating all connections as equal, it reveals who holds privileged positions by virtue of the intensity, not merely the existence, of their relationships.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مجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Weighted Social Network Analysis · Degree Centrality. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare