পদ্ধতির তুলনা করুন

	বেয়েশীয় অন্তর্বর্তী কেন্দ্রিকতা (Bayesian Betweenness Centrality)	ভারিত বিটুইননেস সেন্ট্রালিটি
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	নেটওয়ার্ক বিশ্লেষণ
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2010s	2010
প্রবর্তক	Brandes, U. (betweenness); Bayesian extension developed by multiple authors (2010s)	Opsahl, T.; Agneessens, F.; Skvoretz, J. (extending Freeman 1977 and Brandes 2001)
ধরন	Probabilistic network centrality measure	Centrality measure (path-based)
মৌলিক উৎস	Newman, M.E.J. (2010). Networks: An Introduction. Oxford University Press. ISBN: 978-0-19-920665-0	Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251.
অপর নাম	Bayesian BC, probabilistic betweenness centrality, uncertainty-aware betweenness centrality, posterior betweenness estimation	WBC, weighted shortest-path betweenness, edge-weighted betweenness, geodesic betweenness (weighted)
সম্পর্কিত	3	6
সারসংক্ষেপ	Bayesian Betweenness Centrality estimates how often a node lies on shortest paths in a network while explicitly quantifying uncertainty arising from incomplete, sampled, or noisy edge observations. Rather than producing a single point estimate, it yields a posterior distribution over betweenness scores, enabling credible intervals and probabilistic comparisons between nodes.	Weighted Betweenness Centrality extends Freeman's betweenness measure to edge-weighted graphs by routing shortest paths through a tunable transformation of edge weights. Nodes that sit on many high-value shortest paths receive high scores, identifying brokers and bridges in social, biological, and information networks where tie strength matters.