পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| নির্দেশিত অন্তর্বর্তী কেন্দ্রিকতা× | ডিরেক্টেড পেজর্যাঙ্ক× | |
|---|---|---|
| ক্ষেত্র | নেটওয়ার্ক বিশ্লেষণ | নেটওয়ার্ক বিশ্লেষণ |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 1977 | 1998 |
| প্রবর্তক≠ | Freeman, L. C. | Brin, S. & Page, L. |
| ধরন≠ | Centrality measure (directed graph) | Iterative authority-scoring algorithm |
| মৌলিক উৎস≠ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ | Brin, S. & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Proceedings of the 7th International Conference on World Wide Web (WWW7), 107–117. Elsevier. link ↗ |
| অপর নাম | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness | PageRank, PR, Google PageRank, directed link analysis |
| সম্পর্কিত | 5 | 5 |
| সারসংক্ষেপ≠ | 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. | Directed PageRank is a link-based authority scoring algorithm that assigns importance scores to nodes in a directed graph by iteratively redistributing rank through outgoing edges. Introduced by Brin and Page in 1998 as the backbone of Google Search, it measures not just how many in-links a node has but how authoritative the nodes pointing to it are. |
| ScholarGateডেটাসেট ↗ |
|
|