方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Krackhardt Hierarchy Measures× | 社会网络分析× | |
|---|---|---|
| 领域≠ | Sociology | 网络分析 |
| 方法族≠ | Process / pipeline | Machine learning |
| 起源年份≠ | 1994 | 1934 (sociometry); 1994 (modern formalization) |
| 提出者≠ | David Krackhardt | Moreno, J.L.; formalized by Wasserman & Faust |
| 类型≠ | Set of four graph-theoretic indices of how hierarchical a network is | Structural/relational analysis framework |
| 开创性文献≠ | Krackhardt, D. (1994). Graph theoretical dimensions of informal organizations. In K. M. Carley & M. J. Prietula (Eds.), Computational Organization Theory (pp. 89–111). Lawrence Erlbaum Associates. DOI ↗ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| 别名 | Krackhardt GTD, graph-theoretic dimensions of hierarchy, Krackhardt connectedness-hierarchy-efficiency-LUB, out-tree hierarchy measures | SNA, network analysis, sociometric analysis, relational analysis |
| 相关 | 5 | 5 |
| 摘要≠ | Krackhardt's graph-theoretic dimensions provide four indices that together measure how closely a directed network approximates a pure hierarchy — formally, an out-tree. The dimensions are connectedness (is everyone linked?), hierarchy (are ties asymmetric, i.e., non-reciprocated?), efficiency (are there no redundant ties?), and least upper bound (does every pair share a common superior?). Each is scaled from 0 to 1, and a network scoring 1 on all four is a perfect hierarchy. | 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数据集 ↗ |
|
|