基于共同好友数的在线社会网络社区发现算法

Online Social Network Community Structure Detection Algorithm Based on Number of Shared Friends

为了快速准确地找到在线社会网络的社区结构,提出了一种基于共同好友数和节点邻居信息的社区结构发现算法。该算法以共同好友数最多的两个节点为初始社区,不断寻找与社区连接性最强的节点,并以节点Q值为衡量标准,判断是否将该节点加入到初始社区中,最后根据节点邻居所在初始社区信息确定最终的社区划分。针对两个经典社会网络和人工生成网络数据的实验划分结果表明,该算法是可行和有效的。

To partition online social networks into groups fast and correctly, this paper proposes an algorithm for detecting community structures in online social networks based on shared friends and node neighbors information. By looking for the maximum number of shared friends based on the maximum degree node, the initial community included two nodes is found, and Q value of the node is used to decide whether the node of initial community neighbor is added into the community. The final community structure is decided by the initial community information of node neighbors. Two classical social networks and synthetic datasets are used to test the performance of the algorithm. Experimental results show that the proposed algorithm is viable and effective.