Directed Modularity Analysis
Directed modularity analysis extends the classic Newman-Girvan modularity framework to directed graphs, where edges carry a source and a destination. Formalized by Leicht and Newman in 2008, it partitions nodes into communities by maximizing a modularity score that accounts for each node's separate in-degree and out-degree in the null model, making it the standard approach for community detection in citation networks, information flows, and other asymmetric relational data.
Rekodi ya chanzo
Nukuu zimehamishwa kwa uhalisi kutoka kwa rekodi ya chanzo cha mbinu. Hakuna uthibitisho wa kiwango cha dai unaodokezwa kutoka kwao.
- Leicht, E. A., & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703. · DOI 10.1103/PhysRevLett.100.118703
- 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
Madai yaliyotunzwa
Madai yamehifadhiwa katika daftari la ushahidi, kila moja ikiwa na tathmini yake.
Mwonekano huu haubuni tathmini ya dai wakati daftari haina yoyote.
Mbinu zinazohusiana
Zilizotengenezwa kutoka kwa grafu ya mbinu na kuonyeshwa kama uhusiano uliopendekezwa na mashine — hakuna dai la ushahidi linalodokezwa.