পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| নির্দেশিত নৈকট্য কেন্দ্রীয়তা× | নির্দেশিত অন্তর্বর্তী কেন্দ্রিকতা× | |
|---|---|---|
| ক্ষেত্র | নেটওয়ার্ক বিশ্লেষণ | নেটওয়ার্ক বিশ্লেষণ |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 1979–1994 | 1977 |
| প্রবর্তক≠ | Freeman, L. C.; Wasserman, S. & Faust, K. | Freeman, L. C. |
| ধরন≠ | Centrality measure | Centrality measure (directed graph) |
| মৌলিক উৎস≠ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38269-4 | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| অপর নাম | directed closeness, in-closeness centrality, out-closeness centrality, directional closeness | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness |
| সম্পর্কিত | 5 | 5 |
| সারসংক্ষেপ≠ | 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 Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies. |
| ScholarGateডেটাসেট ↗ |
|
|