Detecting and generating overlapping nested communities
Nestedness has been observed in a variety of networks but has been primarily viewed in the context of bipartite networks. Numerous metrics quantify nestedness and some clustering methods identify fully nested parts of graphs, but all with similar limitations. Clustering approaches also fail to uncov...
Elmentve itt :
Szerzők: |
Gera Imre London András |
---|---|
Dokumentumtípus: | Cikk |
Megjelent: |
2023
|
Sorozat: | APPLIED NETWORK SCIENCE
8 No. 1 |
Tárgyszavak: | |
doi: | 10.1007/s41109-023-00575-2 |
mtmt: | 34093227 |
Online Access: | http://publicatio.bibl.u-szeged.hu/28502 |
Hasonló tételek
-
Greedy algorithm for edge-based nested community detection
Szerző: Gera Imre, et al.
Megjelent: (2022) -
Applications of overlapping community detection [abstract] /
Szerző: Bóta András, et al.
Megjelent: (2010) -
A high resolution clique-based overlapping community detection algorithm for small-world networks
Szerző: Bóta András, et al.
Megjelent: (2015) -
Dynamic communities and their detection
Szerző: Bóta András, et al.
Megjelent: (2011) -
Preference relation and Community detection
Szerző: Dombi József, et al.
Megjelent: (2019)