Cargando…
Inverse Resolution Limit of Partition Density and Detecting Overlapping Communities by Link-Surprise
Finding overlapping communities of complex networks remains a challenge in network science. To address this challenge, one of the widely used approaches is finding the communities of links by optimizing the objective function, partition density. In this study, we show that partition density suffers...
Autores principales: | Lee, Juyong, Zhang, Zhong-Yuan, Lee, Jooyoung, Brooks, Bernard R., Ahn, Yong-Yeol |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5622083/ https://www.ncbi.nlm.nih.gov/pubmed/28963540 http://dx.doi.org/10.1038/s41598-017-12432-1 |
Ejemplares similares
-
Overlapping community detection in networks based on link partitioning and partitioning around medoids
por: Ponomarenko, Alexander, et al.
Publicado: (2021) -
Combined node and link partitions method for finding overlapping communities in complex networks
por: Jin, Di, et al.
Publicado: (2015) -
Modular structure of brain functional networks: breaking the resolution limit by Surprise
por: Nicolini, Carlo, et al.
Publicado: (2016) -
Hidden Information Revealed by Optimal Community Structure from a Protein-Complex Bipartite Network Improves Protein Function Prediction
por: Lee, Juyong, et al.
Publicado: (2013) -
Finding multiple reaction pathways via global optimization of action
por: Lee, Juyong, et al.
Publicado: (2017)