Discovery of Community in Microblog Based on K-means Algorithm

摘要：

　　This paper proposed a algorithm based on the discovery of community in microblog using K-means algorithm.This algorithm defined the group information degree of every two nodes and dynamic distribute the weights of network edges.Through the nodes link matrix to proceed cluster analysis, the approach identified the network to k communities, then through the calculation of LC module degrees to determine the ideal community network structure.Through the experimental comparison we found that this algorithm takes into account the communication between users.It is conducive to optimizing the conditions of community found and more in line with the actual situation of the microblog network, making more accurate result of division of the community.

关键词： social networking microblog communities K-means algorithm nodes link group information degree LC module degree

作者: YANG Changchun DING Hong XUE Hengxin

作者单位: School of Economics &Management, Nanjing University of Science & Technology, Nanjing 210094, China;S School of Information Science & Engineering, Changzhou University, Changzhou 213000, China School of Economics &Management, Nanjing University of Science & Technology, Nanjing 210094, China

会议类型: 国际会议

会议名称: 第一届信息获取与知识服务国际会议暨第六届搜索行为与用户认知研讨会

会议地点: 武汉

会议语种:英文

页码: 178-182

在线出版日期: 2014-10-10（万方平台首次上网日期，不代表论文的发表时间）