পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| ওয়েটেড আইগেনভেক্টর সেন্ট্রালিটি× | ভারিত নৈকট্য কেন্দ্রীয়তা× | |
|---|---|---|
| ক্ষেত্র | নেটওয়ার্ক বিশ্লেষণ | নেটওয়ার্ক বিশ্লেষণ |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 1987 (binary); 2010 (weighted generalization) | 2010 |
| প্রবর্তক≠ | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) | Opsahl, T.; Agneessens, F.; Skvoretz, J. |
| ধরন≠ | Spectral centrality measure | Centrality measure (network analysis) |
| মৌলিক উৎস≠ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ | Opsahl, T., Agneessens, F. & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI ↗ |
| অপর নাম | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige | weighted closeness, generalized closeness centrality, WCC, distance-weighted closeness |
| সম্পর্কিত | 6 | 6 |
| সারসংক্ষেপ≠ | Weighted eigenvector centrality extends the classic eigenvector centrality measure to graphs where edges carry numerical weights, scoring each node proportionally to the sum of its neighbors' scores multiplied by the connecting edge weights. Nodes score highly not just by having many connections but by being strongly linked to other influential nodes, making the measure sensitive to both tie strength and network position simultaneously. | Weighted closeness centrality extends the classic closeness measure to networks where edges carry numerical weights — such as frequency, strength, or cost — by incorporating those weights into shortest-path distances. Nodes that can reach others quickly along strong or efficient connections receive higher scores, making it a richer indicator of information-spreading potential than its binary counterpart. |
| ScholarGateডেটাসেট ↗ |
|
|