.png){kind=icon}
返回
A cellular learning automata based algorithm for detecting community structure in complex networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2014.04.087.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Community structure is a common and important property of complex networks. The detection of communities has great significance for understanding the function and organization of networks. Generally, community detection can be formulated as a modularity optimization problem. However, traditional modularity optimization based algorithms have the resolution limit that they may fail to find communities which are smaller than a certain size. In this paper, we propose a cellular learning automata based algorithm for detecting communities in complex networks. Our algorithm models the whole network as an irregular cellular learning automata (ICLA) and reveals the optimal col-ill-flunky structure through the evolution of the cellular learning automata. By interacting with both the global and local environments, our algorithm effectively solves the resolution limit problem of modularity optimization. The experiments on both synthetic and real-world networks demonstrate that our algorithm is effective and efficient at detecting community structure in complex networks. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Community detection
Complex network
Modularity optimization
Resolution limit
Cellular learning automata
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
Satisfied and fair two-sided matching method considering dual-reference with linguistic preference
PREAI
分享收藏分享收藏
查看更多内容