Võrdle meetodeid
Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.
| Suunatud multipleksvõrgu analüüs× | Suunatud kogukonna tuvastamine× | |
|---|---|---|
| Valdkond | Võrgustikuanalüüs | Võrgustikuanalüüs |
| Perekond | Machine learning | Machine learning |
| Tekkeaasta≠ | 2013–2014 | 2008 |
| Looja≠ | Kivela, M.; De Domenico, M. et al. | Leicht, E. A. & Newman, M. E. J.; Rosvall, M. & Bergstrom, C. T. |
| Tüüp≠ | Multi-layer directed graph framework | Graph partitioning / modularity optimization |
| Algallikas≠ | Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014). Multilayer networks. Journal of Complex Networks, 2(3), 203–271. DOI ↗ | Leicht, E. A. & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703. DOI ↗ |
| Rööpnimetused | directed multilayer network analysis, directed multiplex graphs, asymmetric multiplex network analysis, DMNA | directed graph clustering, community detection in digraphs, directed modularity optimization, directed network partitioning |
| Seotud | 6 | 6 |
| Kokkuvõte≠ | Directed multiplex network analysis models systems where the same set of nodes are connected by multiple types of directed (asymmetric) relationships across distinct layers — such as citation flows, information cascades, or authority hierarchies co-existing simultaneously. It extends multiplex network analysis by preserving both layer identity and edge directionality, enabling richer structural and dynamic insights. | Directed community detection identifies densely interconnected groups of nodes in a directed network, accounting for the asymmetry of edges (e.g., A follows B does not imply B follows A). Adapting modularity or flow-based criteria to directed graphs reveals clusters that undirected methods systematically miss, making it essential for citation networks, follower graphs, and biological regulatory pathways. |
| ScholarGateAndmestik ↗ |
|
|