基于多核心节点的增量式动态社区发现算法

Incremental dynamic community discovery algorithm based on multi-core nodes

针对动态社区发现算法通常基于社区结构平稳变化的假设,而难以应对演化过程中可能出现的大量社区消亡或涌现等突发事件的问题,提出了一种基于多核心节点的增量式动态社区发现算法MCNIDCD。首先,将核心节点分为扩散型和内聚型,制定4种增量更新策略。其次,通过局部更新调整节点社区归属,并采用增量模块度方法优化社区结构。最后,实现社区合并。在人工和真实网络上对该算法的性能进行了评估,实验结果表明,在对比目前相关动态社区检测算法时,在人工网络仿真环境中,MCNIDCD算法表现出与社区演化规律的高度契合性;在真实网络实验中,MCNIDCD算法在模块度性能指标上平均提升了28%,并且在稳定性方面具有良好的优势,其优势对于研究动态社区演化过程具有重要的意义。

A new incremental dynamic community discovery algorithm MCNIDCD based on multiple core nodes was proposed to address challenges in dynamic community discovery.It adapted to sudden events like the emergence or disappearance of communities during evolution.MCNIDCD categorized core nodes into diffusion and cohesion types,and devised four incremental updating strategies.It adjusted node community membership locally and optimized community structure using an incremental modularity method to facilitate community merging.Evaluation on artificial and real networks shows MCNIDCD’s high conformity to community evolution patterns.In real network experiments,MCNIDCD exhibits a 28%average improvement in modularity performance and significant stability advantages.Its superiority is important for studying dynamic community evolution.