Cargando…
Surprise maximization reveals the community structure of complex networks
How to determine the community structure of complex networks is an open question. It is critical to establish the best strategies for community detection in networks of unknown structure. Here, using standard synthetic benchmarks, we show that none of the algorithms hitherto developed for community...
Autores principales: | Aldecoa, Rodrigo, Marín, Ignacio |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3544010/ https://www.ncbi.nlm.nih.gov/pubmed/23320141 http://dx.doi.org/10.1038/srep01060 |
Ejemplares similares
-
Deciphering Network Community Structure by Surprise
por: Aldecoa, Rodrigo, et al.
Publicado: (2011) -
Exploring the limits of community detection strategies in complex networks
por: Aldecoa, Rodrigo, et al.
Publicado: (2013) -
Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering
por: Aldecoa, Rodrigo, et al.
Publicado: (2010) -
Critical analysis of (Quasi-)Surprise for community detection in complex networks
por: Xiang, Ju, et al.
Publicado: (2018) -
A Multiagent Memetic Optimization Algorithm Based on Temporal Asymptotic Surprise in Complex Networks to Reveal the Structure of the Dynamic Community
por: Ranjkesh, Somayeh, et al.
Publicado: (2022)