信息与控制2017，Vol.46Issue(2)：178-185,8.DOI:10.13976/j.cnki.xk.2017.0178
最优节点复制的复杂网络重叠社区发现算法
Complex Network Overlapping Community Discovery Algorithm Based on Optimized Node Duplication
摘要
Abstract
It is of interest to find field-free overlapping communities with low computation complexity in complex networks.We design a local measure known as the "correlation coefficient" to evaluate the density of links by using node optimized duplication and is extended to assess the agglomeration of nodes.In addition,we propose an overlapping community detection algorithm based on node optimized duplication,which uses a cutting strategy to decompose the network and excavate independent or overlapping communities.Experimental results on synthetic and real-world networks show that the proposed method has a higher accuracy and efficiency than several classical algorithms.关键词
复杂网络/重叠社区/关联度/节点最优复制/分割策略Key words
complex network/overlapping community/correlation coefficient/node optimized duplication/cutting strategy分类
信息技术与安全科学引用本文复制引用
龙浩,汪浩..最优节点复制的复杂网络重叠社区发现算法[J].信息与控制,2017,46(2):178-185,8.基金项目
国家自然科学基金资助项目(61262014) （61262014）
江西省自然科学基金资助项目(20132BAB201034) （20132BAB201034）
江西省教育厅科技项目(GJJ13224) （GJJ13224）
江西师范大学博士启动基金资助项目 （）
