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...

Descripción completa

Detalles Bibliográficos
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:
Article
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

Internet

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