Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Centralitatea de proximitate direcționată× | Analiza rețelelor sociale direcționate× | |
|---|---|---|
| Domeniu | Analiza rețelelor | Analiza rețelelor |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1979–1994 | 1994 |
| Autorul original≠ | Freeman, L. C.; Wasserman, S. & Faust, K. | Wasserman, S. & Faust, K. |
| Tip≠ | Centrality measure | Structural analysis of directed graphs |
| Sursa seminală | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38269-4 | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| Denumiri alternative | directed closeness, in-closeness centrality, out-closeness centrality, directional closeness | directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis |
| Înrudite | 5 | 5 |
| Rezumat≠ | Directed closeness centrality extends the classical closeness measure to directed networks by separately quantifying how quickly a node can be reached by others (in-closeness) and how quickly it can reach all others (out-closeness). It is a foundational node-level metric in social network analysis and graph theory, used wherever link direction conveys meaningful asymmetry such as citation flows, information cascades, or authority hierarchies. | Directed Social Network Analysis (directed SNA) studies networks in which every tie has an explicit direction — from a sender to a receiver — rather than treating relationships as symmetric. It extends the classical SNA toolkit with in-degree, out-degree, reciprocity, and asymmetric path measures, making it the appropriate framework wherever relationship direction carries substantive meaning, such as citation flows, advice-seeking, follower graphs, or information cascades. |
| ScholarGateSet de date ↗ |
|
|