ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

מרכזיות וקטור עצמי משוקללת×מרכזיות וקטור עצמי×
תחוםניתוח רשתותניתוח רשתות
משפחהMachine learningMachine learning
שנת המקור1987 (binary); 2010 (weighted generalization)1972
הוגה השיטהBonacich, P. (binary); Opsahl, T. et al. (weighted extension)Bonacich, P.
סוגSpectral centrality measureCentrality 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 prestigeeigenvector centrality, EC, Bonacich centrality, power centrality
קשורות66
תקציר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מערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Weighted Eigenvector Centrality · Eigenvector Centrality. אוחזר בתאריך 2026-06-15 מתוך https://scholargate.app/he/compare