ScholarGate
Asistent

Uporedite metode

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

Dinamička centralnost stepena×Dinamičko otkrivanje zajednica×
OblastAnaliza mrežaAnaliza mreža
PorodicaMachine learningMachine learning
Godina nastanka20122010 (key formalization); earlier work 2002–2009
TvoracHolme, P. & Saramaki, J.; Kim, H. & Anderson, R.Mucha, P. J. et al. (key formalization); earlier work by Girvan & Newman (2002)
TipCentrality measure (temporal extension)Graph clustering / community discovery
Temeljni izvorHolme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010). Community structure in time-dependent, multiscale, and multiplex networks. Science, 328(5980), 876–878. DOI ↗
Drugi nazivitime-varying degree centrality, temporal degree centrality, evolving degree centrality, DDCDCD, temporal community detection, evolving community detection, dynamic graph clustering
Srodne55
SažetakDynamic degree centrality extends the classical degree centrality measure to networks that change over time. Rather than counting a node's connections in a single static snapshot, it tracks how many contacts each node maintains across successive time windows or contact events, producing a time-resolved importance profile for every actor in the network.Dynamic community detection identifies groups of densely connected nodes in networks that evolve over time, tracking how communities form, merge, split, and dissolve across temporal snapshots. Developed to extend static modularity optimization to time-varying structures, it is widely used in social, biological, and communication network research.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: Dynamic Degree Centrality · Dynamic Community Detection. Preuzeto 2026-06-18 sa https://scholargate.app/sr/compare