विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| भारित सामाजिक नेटवर्क विश्लेषण (Weighted Social Network Analysis)× | डिग्री सेंट्रैलिटी× | |
|---|---|---|
| क्षेत्र | नेटवर्क विश्लेषण | नेटवर्क विश्लेषण |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2004–2010 | 1978 |
| प्रवर्तक≠ | Barrat, A.; Opsahl, T. et al. | Freeman, L. C. |
| प्रकार≠ | Network analysis framework | Node-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 analysis | node degree, degree score, DC, connectivity centrality |
| संबंधित | 6 | 6 |
| सारांश≠ | 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डेटासेट ↗ |
|
|