ScholarGate
Asistent

Uporedite metode

Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.

Centralnost svojstvenog vektora×Centralnost bliskosti×
OblastAnaliza mrežaAnaliza mreža
PorodicaMachine learningMachine learning
Godina nastanka19721950 (formalized 1979)
TvoracBonacich, P.Bavelas, A.; formalized by Freeman, L. C.
TipCentrality measureNode-level centrality index
Temeljni izvorBonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. DOI ↗Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗
Drugi nazivieigenvector centrality, EC, Bonacich centrality, power centralitycloseness, farness-based centrality, geodesic closeness, normalized closeness centrality
Srodne66
SažetakEigenvector 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.Closeness centrality measures how quickly a node can reach all others in a network by computing the inverse of its average shortest-path distance to every other node. First described by Bavelas (1950) and formally unified by Freeman (1979), it identifies nodes that can spread information or resources efficiently across the entire graph — not merely nodes with many direct contacts.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: Eigenvector Centrality · Closeness Centrality. Preuzeto 2026-06-18 sa https://scholargate.app/sr/compare