为了更好地将社交网络中的社团结构识别出来,努力实现社团结构的自然划分,在对模块度参数重新定义的基础上,提出了一种基于加权网络模块强度的社团划分算法。该算法的复杂性较低,能有效地完成加权复杂网络的社团划分。实验的模拟和仿真证实了算法的可行性和有效性。
In order to pick the community structure in social network out more accurately and to achieve the natural division, this paper designed a new community partition algorithm based on the module strength which modified by the famous idea modu- larity. The complexity of the algorithm is acceptable and experiments for several real-world social networks are valid which con- firme the feasibility and effectiveness of the algorithm based on module strength.