中文摘要：

为解决当前社区发现算法中模块度和社区划分精确度偏低、不能动态利用历史记录信息的不足,提出基于代理节点效益最大化筛选机制的高效动态社交网络社区发现算法。将节点博弈机制引入到动态网络社区划分中,利用代理节点效用函数与开销削减函数,定期从一组预定义的行为集合中选择最大化利益策略,当节点博弈状态达到纳什均衡时,可获取网络社区结构的时间快照,利用上一次得到的时间快照信息继续博弈,发现新的社区结构,获得社区结构的动态信息。理论分析和仿真结果表明,与当前社区发现算法相比,该算法在社区划分模块度和划分社区精确度上具备更好的划分效果。

英文摘要：

To solve the low modularity,low community division accuracy and inefficient use of the history snapshots dynamically in the traditional community detection algorithms,a dynamic community discovery algorithm for social network based on game theory（EDCD-PNBMG）was presented.By introducing reasonable utility function,a set of predefined behaviors collection was chosen from its utility function to maximize its benefits.A snapshot of community structure appeared when the game entered the Nash equilibrium.The nodes involved in the network as well as the agents made full use of history snapshots information to discover the structure of the community,and then the dynamic information of community was got.Results of theoretical analysis and simulation show that the EDCD-PNBMG outperforms the other existing algorithm in terms of the community detection modularity and fine-grained,and it improves the effectiveness of community division.