Machine learningNetwork science

Uteženi izmerak središnjosti

Uteženi izmerak središnjosti proširuje Freemanov izmerak središnjosti na grafove s uteženim rubovima usmeravanjem najkraćih putova kroz podesivu transformaciju utege rubova. Čvorovi koji se nalaze na mnogim najkraćim putovima visoke vrednosti dobivaju visoke rezultate, identificirajući posrednike i mostove u društvenim, biološkim i informacijskim mrežama gde je jačina veze bitna.

Otvorite u MethodMindUskoroVideoUskoroDownload slides

Pročitajte cijelu metodu

Samo za članove

Prijavite se besplatnim računom kako biste pročitali ovaj odjeljak.

Prijavite se

Method map

The neighbourhood of related methods — select a node to explore.

+1 more

Izvori

  1. Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI: 10.1016/j.socnet.2010.03.006
  2. Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2), 163–177. DOI: 10.1080/0022250X.2001.9990249

Kako citirati ovu stranicu

ScholarGate. (2026, June 3). Weighted Betweenness Centrality (Geodesic Path-Count on Edge-Weighted Graphs). ScholarGate. https://scholargate.app/hr/network-analysis/weighted-betweenness-centrality

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Citirana u

ScholarGateWeighted Betweenness Centrality (Weighted Betweenness Centrality (Geodesic Path-Count on Edge-Weighted Graphs)). Preuzeto 2026-06-15 s https://scholargate.app/hr/network-analysis/weighted-betweenness-centrality · Skup podataka: https://doi.org/10.5281/zenodo.20539026