.png){kind=icon}
返回
Compressing Networks with Super Nodes
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-018-29174-3.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Community detection is a commonly used technique for identifying groups in a network based on similarities in connectivity patterns. To facilitate community detection in large networks, we recast the network as a smaller network of 'super nodes', where each super node comprises one or more nodes of the original network. We can then use this super node representation as the input into standard community detection algorithms. To define the seeds, or centers, of our super nodes, we apply the 'CoreHD' ranking, a technique applied in network dismantling and decycling problems. We test our approach through the analysis of two common methods for community detection: modularity maximization with the Louvain algorithm and maximum likelihood optimization for fitting a stochastic block model. Our results highlight that applying community detection to the compressed network of super nodes is significantly faster while successfully producing partitions that are more aligned with the local network connectivity and more stable across multiple (stochastic) runs within and between community detection algorithms, yet still overlap well with the results obtained using the full network.
Keyword:
GRAPHS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
28.3W
被引数:
83.5W
机构
引用论文
.png){kind=icon}
分享收藏Health Literacy – a review of research using the European Health Literacy Questionnaire (HLS-EU-Q16) in 2010-2018健康素养-2010-2018使用欧洲健康素养问卷 (HLS-EU-Q16) 进行的研究综述
OAAI
OAAI分享收藏Investigating the effects of business process orientation on organizational innovation performance
PREAI
分享收藏
查看更多内容