Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| Krackhardt Hierarchy Measures× | Generalized Blockmodeling× | |
|---|---|---|
| Tieteenala | Sociology | Sociology |
| Menetelmäperhe | Process / pipeline | Process / pipeline |
| Syntyvuosi≠ | 1994 | 2005 |
| Kehittäjä≠ | David Krackhardt | Patrick Doreian, Vladimir Batagelj & Anuška Ferligoj |
| Tyyppi≠ | Set of four graph-theoretic indices of how hierarchical a network is | Direct optimization partition of a network into positions with typed blocks |
| Alkuperäislähde≠ | 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 ↗ | Doreian, P., Batagelj, V., & Ferligoj, A. (2005). Generalized Blockmodeling. Cambridge University Press. ISBN: 978-0-521-84085-9 |
| Rinnakkaisnimet | Krackhardt GTD, graph-theoretic dimensions of hierarchy, Krackhardt connectedness-hierarchy-efficiency-LUB, out-tree hierarchy measures | generalized blockmodel, direct blockmodeling, pre-specified blockmodeling, Doreian-Batagelj-Ferligoj blockmodeling |
| Liittyvät | 5 | 5 |
| Tiivistelmä≠ | 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. | Generalized blockmodeling, developed by Doreian, Batagelj, and Ferligoj, partitions the actors of a network into positions and simultaneously characterizes the ties between positions as one of several allowed block types — null, complete, regular, dominant, and others. Rather than the indirect, two-step approach of computing equivalences and then clustering, it directly searches for the partition that minimizes the inconsistency between the observed network and an idealized block structure, optionally one the analyst pre-specifies from theory. |
| ScholarGateAineisto ↗ |
|
|