展示复杂网络社团结构的社团引力导引的布局算法-计算机辅助设计与.pdfVIP

第27 卷 第 8 期 计算机辅助设计与图形学学报 Vol. 27 No.8 2015 年8 月 Journal of Computer-Aided Design Computer Graphics Aug. 2015 展示复杂网络社团结构的社团引力导引的布局算法 吴 渝, 李藻旭, 李红波, 温 磊 (重庆邮电大学网络智能研究所 重庆 400065) (wuyu@cqupt.edu.cn) : 由于传统的力导引布局方法大都无法展示复杂网络的社团结构, 提出一种可有效展示复杂网络社团结构的 布局算法——社团引力导引的布局算法. 该算法在力导引布局算法的基础上对每个节点加入社团引力, 并引入 k-means 算法, 使同一社团的节点能够向社团的中心位置聚拢. 不同于先网络聚类再可视化布局的传统做法, 该算法 不需要预先对节点分类, 可以在布局的同时完成节点聚类. 实验中使用模块度指标评估社团结构的强弱程度, 结果 表明, 文中算法可以呈现明显的聚类效果, 简单、易于实现, 且收敛速度快. ：数据可视化; 社团结构; 复杂网络; 力导引算法 ：TP391 A Community-Gravity-Directed Algorithm for Showing Community Structure of Complex Networks Wu Yu, Li Zaoxu, Li Hongbo, and Wen Lei (Institute of Web Intelligence, Chongqing University of Posts and Telecommunications, Chongqing 400065) Abstract: Since most of traditional force-directed algorithms cannot present the community structure of complex networks, this paper proposes a new graph layout method, called community-gravity-directed algo- rithm, to effectively visualize the community structure of complex networks. Based on the force-directed algorithm, the proposed algorithm introduces community-gravity force to each node, and employs k-means algorithm to make nodes in the same community near to the center of the community. Different from tradi- tional approaches which have to cluster network before visualization, the proposed algorithm can perform the two steps at the same time, without any node pre-classification. In the experiment, modularity is used to evaluate the strength of community structures. Experimental results show that the proposed algorithm can present a significant clustering effect. It is simple, easy to implement, and has a better convergence rate.