विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| भारित आइगनवेक्टर केंद्रीयता× | डिग्री सेंट्रैलिटी× | |
|---|---|---|
| क्षेत्र | नेटवर्क विश्लेषण | नेटवर्क विश्लेषण |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1987 (binary); 2010 (weighted generalization) | 1978 |
| प्रवर्तक≠ | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) | Freeman, L. C. |
| प्रकार≠ | Spectral centrality measure | Node-level centrality measure |
| मौलिक स्रोत≠ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| उपनाम | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige | node degree, degree score, DC, connectivity centrality |
| संबंधित | 6 | 6 |
| सारांश≠ | Weighted eigenvector centrality extends the classic eigenvector centrality measure to graphs where edges carry numerical weights, scoring each node proportionally to the sum of its neighbors' scores multiplied by the connecting edge weights. Nodes score highly not just by having many connections but by being strongly linked to other influential nodes, making the measure sensitive to both tie strength and network position simultaneously. | 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डेटासेट ↗ |
|
|