পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| ওয়েটেড আইগেনভেক্টর সেন্ট্রালিটি× | আইগেনভেক্টর সেন্ট্রালিটি× | |
|---|---|---|
| ক্ষেত্র | নেটওয়ার্ক বিশ্লেষণ | নেটওয়ার্ক বিশ্লেষণ |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 1987 (binary); 2010 (weighted generalization) | 1972 |
| প্রবর্তক≠ | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) | Bonacich, P. |
| ধরন≠ | Spectral centrality measure | Centrality measure |
| মৌলিক উৎস≠ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ | Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. DOI ↗ |
| অপর নাম | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige | eigenvector centrality, EC, Bonacich centrality, power centrality |
| সম্পর্কিত | 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. | Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network. |
| ScholarGateডেটাসেট ↗ |
|
|