विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| केंद्रीयता विश्लेषण× | सामाजिक नेटवर्क विश्लेषण× | |
|---|---|---|
| क्षेत्र | नेटवर्क विश्लेषण | नेटवर्क विश्लेषण |
| परिवार≠ | Process / pipeline | Machine learning |
| उद्भव वर्ष≠ | 1979 | 1934 (sociometry); 1994 (modern formalization) |
| प्रवर्तक≠ | Linton C. Freeman | Moreno, J.L.; formalized by Wasserman & Faust |
| प्रकार≠ | Descriptive / exploratory network measure family | Structural/relational analysis framework |
| मौलिक स्रोत≠ | Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| उपनाम | Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality | SNA, network analysis, sociometric analysis, relational analysis |
| संबंधित | 5 | 5 |
| सारांश≠ | Centrality analysis is a family of network-analytic measures, formalized by Freeman (1979), that quantifies the structural importance of individual nodes within a graph. Each centrality index captures a distinct mechanism of influence: degree centrality reflects direct connectivity, betweenness centrality identifies nodes that broker information flow, closeness centrality captures proximity to all others, and eigenvector centrality (along with PageRank) rewards connection to highly connected neighbors. | Social Network Analysis (SNA) is a structural method that maps and measures relationships and flows between people, groups, organizations, or other entities modeled as nodes connected by ties (edges). Rather than focusing on individual attributes, SNA reveals how the pattern of connections shapes behavior, influence, information flow, and outcomes within a system. |
| ScholarGateडेटासेट ↗ |
|
|