ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Centralność wektorowa skierowana×Skierowana centralność pośrednictwa×
DziedzinaAnaliza sieciAnaliza sieci
RodzinaMachine learningMachine learning
Rok powstania1972–19871977
TwórcaBonacich, P.Freeman, L. C.
TypCentrality measure (eigenvector-based, directed)Centrality measure (directed graph)
Źródło pierwotneBonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗
Inne nazwydirected EC, asymmetric eigenvector centrality, right eigenvector centrality, left eigenvector centralitydirected BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness
Pokrewne55
PodsumowanieDirected eigenvector centrality extends the classic eigenvector centrality to directed graphs by scoring each node according to the centrality of the nodes that point to it (in-direction) or that it points to (out-direction). A node earns a high score not merely by having many connections but by being connected to other highly central nodes, capturing asymmetric influence in citation networks, social hierarchies, and information flows.Directed Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies.
ScholarGateZbiór danych
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Directed Eigenvector Centrality · Directed Betweenness Centrality. Pobrano 2026-06-15 z https://scholargate.app/pl/compare