In this paper, through thinking on the modularity function that measures the standard of community division, a new algorithm for dividing communities is proposed, called the Connect Intensity Iteration algorithm, or CIIA for short. In this algorithm, a new indicator is proposed.This indicator is the difference between the actual number of edges between two nodes and the number of edges when the edges are randomly placed. It can reflect more information between the nodes. The larger the value of this index, the greater the possibility that the two nodes are divided into the same community, and vice versa. This paper also verifies the algorithm through numerical simulations and real cases, and the results show the feasibility of the algorithm.
翻译:在本文中,通过思考衡量社区划分标准的模块化函数,提出了一种划分社区的新算法,称为连接强度迭代算法,或简称CIIA。在这个算法中,提出了一个新的指标。这个指标是两个节点之间实际边缘数和边缘随机排列时边缘数之间的差别。它可以反映结点之间的更多信息。这个指数越大,两个节点被划分在同一社区的可能性越大,反之亦然。本文还通过数字模拟和真实案例来验证算法,结果显示算法的可行性。