基于通信负载均衡的社交网络图分割方法-计算机工程与应用.PDF

66 2018 ，54（4 ） Computer Engineering and Applications 计算机工程与应用 ⦾大数据与云计算⦾ 用 基于通信负载均衡的社交网络图分割方法 应 1 1 1 1，2 刘 康 ，张雪英 ，李凤莲 ，田玉楚 与 1 1 1 1，2 LIU Kang , ZHANG Xueying , LI Fenglian , TIAN Yuchu 程 g 1.太原理工大学 信息工程学院，山西 晋中 030600 r 工 o 2. 昆士兰科技大学 电机工程及计算机科学学院，澳大利亚 布里斯班 4001 . j 1.College of Information Engineering, Taiyuan University of Technology, Jinzhong, Shanxi 030600, China 机 a 2.School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, QLD 4001, Australia 算 e c . LIU Kang, ZHANG Xueying, LI Fenglian, et al. Graph partitioning method for social networks based on communi- 计 w cation load balancing. Computer Engineering and Applications, 2018, 54 （4 ）：66-71. w Abstract ：Massive data from social networks contains a wealth of information. Among various methods to mine such w information, graph theory is an attractive tool. With the increase of the volume of the graph data, distributed computation of graphs becomes an effective means to deal with large-scale graph data. In distributed graph computation, the time consumed in communications contributes significantly to the overall computation time. A well-designed graph partitioning algorithm can effectively reduce the communications as well as achieve load balancing, thus improving the efficiency of distributed graph computation. Typical examples include the Metis graph partitioning algorithm. However, existing graph partitioning algorithms to deal with