ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Sentraliti Eigenvektor Temporal×Pusat Teras Eigenvector×
BidangAnalisis RangkaianAnalisis Rangkaian
KeluargaMachine learningMachine learning
Tahun asal2011-20171972
PengasasGrindrod, P.; Higham, D. J.; Taylor, D. et al.Bonacich, P.
JenisCentrality measure for temporal networksCentrality measure
Sumber perintisGrindrod, P., Parsons, M. C., Higham, D. J., & Estrada, E. (2011). Communicability across evolving networks. Physical Review E, 83(4), 046120. DOI ↗Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. DOI ↗
Aliasdynamic eigenvector centrality, time-varying eigenvector centrality, TEC, temporal communicability centralityeigenvector centrality, EC, Bonacich centrality, power centrality
Berkaitan56
RingkasanTemporal eigenvector centrality extends the classical eigenvector centrality to networks that change over time. By accounting for the ordering and timing of connections, it identifies nodes that are influential not merely because of many simultaneous connections, but because they sit at the crossroads of sequentially important pathways across multiple time slices of the network.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.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED

Pergi ke carian Download slides

ScholarGateBandingkan kaedah: Temporal Eigenvector Centrality · Eigenvector Centrality. Dicapai 2026-06-15 daripada https://scholargate.app/ms/compare