विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| डिग्री सेंट्रैलिटी× | निकटता केंद्रीयता (Closeness Centrality)× | |
|---|---|---|
| क्षेत्र | नेटवर्क विश्लेषण | नेटवर्क विश्लेषण |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1978 | 1950 (formalized 1979) |
| प्रवर्तक≠ | Freeman, L. C. | Bavelas, A.; formalized by Freeman, L. C. |
| प्रकार≠ | Node-level centrality measure | Node-level centrality index |
| मौलिक स्रोत≠ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ | Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| उपनाम | node degree, degree score, DC, connectivity centrality | closeness, farness-based centrality, geodesic closeness, normalized closeness centrality |
| संबंधित | 6 | 6 |
| सारांश≠ | 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. | 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डेटासेट ↗ |
|
|