哈尔滨工程大学学报Issue(6)：809-813,5.DOI:10.3969/j.issn.1006-7043.201404026
基于引力作用的可选粒度社区发现算法
Optional granularity community detection algorithm based on gravitation
摘要
Abstract
Community detection is an important field in the study of complex networks, and it is widely applied. But for most of the existing algorithms at present, community structure is determined by some community evaluation function, and only one division result can be obtained. Referenced from the galaxy model and the law of universal gravitation, a new community detection algorithm of complex network based on gravitational search is proposed, nodes in a network are given quality, and community framework is built. Then community structure is divided via gravitation. The granularity of the detected communities can be selected, and thereby a variety of division results can be obtained, without prior knowledge and the related parameters. Experiments in real networks, and compari⁃son with other pre⁃existing community detection algorithms prove that, the community structure of complex networks can be effectively and accurately excavated via the proposed algorithm.关键词
复杂网络/可选粒度/社区发现/引力作用Key words
complex network/optional granularity/community detection/gravitation分类
信息技术与安全科学引用本文复制引用
董宇欣,迟阔,印桂生..基于引力作用的可选粒度社区发现算法[J].哈尔滨工程大学学报,2015,(6):809-813,5.基金项目
国家自然科学基金资助项目（61272186）；黑龙江省自然科学基金资助项目（ F201110）． （）
