ScholarGate
Msaidizi
Machine learningNetwork science

Uchanganuzi wa Modularity

Uchanganuzi wa modularity ni mbinu ya sayansi ya mitandao, iliyoandaliwa na Newman na Girvan mwaka 2004, ambayo hugundua muundo wa jumuiya katika grafu kwa kupima kama kingo zimejilimbikizia zaidi ndani ya vikundi kuliko inavyotarajiwa kwa bahati. Kielelezo chake cha ubora wa scalar Q huongoza algoriti zinazogawanya nodi katika makundi yenye mshikamano, na kuifanya kuwa mfumo unaotumiwa zaidi kwa ugunduzi wa jumuiya katika mitandao ya kijamii, kibiolojia, na kiteknolojia.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

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

+14 more

Vyanzo

  1. Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. DOI: 10.1103/PhysRevE.69.026113
  2. Newman, M. E. J. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23), 8577–8582. DOI: 10.1073/pnas.0601602103

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 3). Modularity Analysis (Newman-Girvan Community Detection Framework). ScholarGate. https://scholargate.app/sw/network-analysis/modularity-analysis

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

Imerejelewa na

ScholarGateModularity Analysis (Modularity Analysis (Newman-Girvan Community Detection Framework)). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/network-analysis/modularity-analysis · Seti ya data: https://doi.org/10.5281/zenodo.20539026