浏览全部资源
扫码关注微信
哈尔滨工程大学 信息与通信工程学院,黑龙江 哈尔滨 150001
[ "王桐(1977-),男,黑龙江哈尔滨人,哈尔滨工程大学副教授,主要研究方向为无线网络、云计算与信息安全。" ]
[ "赵昕琳(1990-),女,黑龙江哈尔滨人,哈尔滨工程大学硕士生,主要研究方向为社交网络,推荐系统。" ]
网络出版日期:2014-11,
纸质出版日期:2014-11-30
移动端阅览
王桐, 赵昕琳. 基于改进蛙跳算法的社区划分方法[J]. 通信学报, 2014,35(Z2):48-52.
Tong WANG, Xin-lin ZHAO. Improved shuffled frog-leaping algorithm based network community detection method[J]. Journal on communications, 2014, 35(Z2): 48-52.
王桐, 赵昕琳. 基于改进蛙跳算法的社区划分方法[J]. 通信学报, 2014,35(Z2):48-52. DOI: 10.3969/j.issn.1000-436x.2014.z2.008.
Tong WANG, Xin-lin ZHAO. Improved shuffled frog-leaping algorithm based network community detection method[J]. Journal on communications, 2014, 35(Z2): 48-52. DOI: 10.3969/j.issn.1000-436x.2014.z2.008.
现有的网络社区划分方法以社区为主体,机械地将每一个节点划分到某一个社区,在真实网络中,对于活跃度低的用户进行划分会大大降低划分精确度,同时增加时间复杂度,并具有较小的划分意义。因此,将蛙跳算法与社区划分相结合,通过对青蛙性能的排序,提取活跃度高的用户,从而提高划分精确度。实验结果表明该方法具有良好的性能。
Existing community method aims to divide nodes into a community mechanically.In a real network
it will reduce the classification accuracy greatly for the low active users
while increasing the time complexity.It has small significance.Therefore
this paper will combine shuffled leap-frog algorithm with community detection method.It will extract active users by sorting on properties of frog
so as to improve the efficiency of division.Experimental results show that the method has good performance.
KERNIGHAN B W , LIN S . An efficient heuristic procedure for partitioning graphs [J ] . Bell System Technical Journal , 1970 , 49 : 291 - 307 .
BARNARD S T , SIMON H D . Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems [J ] . Concurrency:Practice and Experience , 1994 , 6 : 101 - 117 .
MORRISON N , LORD R T , INGGS M R . The Gauss-newton algorithm applied to track-while-scan radar [A ] . 2007 IET International Conference on Radar Systems [C ] . 2007 . 1 - 5 .
EGHBAL M , SAHA T K , HASAN K N . Transmission expansion planning by meta-heuristic techniques:a comparison of shuffled frog leaping algorithm,PSO and GA [A ] . 2011 IEEE Power and Energy Society General Meeting [C ] . 2011 . 1 - 8 .
ZHANG N . Community Structure in Complex Networks Partitioning Algorithm Research [D ] . Dalian University of Technology , 2009 .
GALKOWSKI P J , ISLAM M A . An alternative derivation of the modified gain function of Song and Speyer [J ] . IEEE Transactions on Automatic Control , 1991 , 36 : 1323 - 1326 .
EDMONDS J . Matroids and the greedy algorithm [J ] . Mathematical Programming , 1971 , 1 : 127 - 136 .
ZHU W Q . Research and Application of Rough Sets and Ant Colony Algorithm in Finding Community Structure in the Network [D ] . Soochow University , 2011 .
HU Z H . Based on the Partheno Genetic Algorithm of the Weighted Complex Network Community Division [D ] . University of an Inner Mongolia , 2012 .
AMIRI B , FATHIAN M , MAROOSI A . Application of shuffled frog-leaping algorithm on clustering [J ] . The International Journal of Advanced Manufacturing Technology , 2009 , 45 : 199 - 209 .
BHATTACHARJEE K K , SARMAH S P . Computational Collective Intelligence Technologies and Applications [M ] . Springer Berlin Heidelberg , 2012 : 513 - 522 .
AMIRI B , FATHIAN M , MAROOSI A . Application of shuffled frog-leaping algorithm on clustering [J ] . The International Journal of Advanced Manufacturing Technology , 2009 , 45 : 199 - 209 .
ZHEN Z , WANG Z , GU Z , et al . Advances in Computation and Intelligence [M ] . Springer Berlin Heidelberg , 2007 .
LUO Y R . Multi Population Genetic Algorithm and Its Application in the Community Partition of Complex Networks [D ] . Jiangxi University of Science , 2012 .
TP K , BE B , J N . Staff Expertation in a community services division [J ] . The Nebraska State Medical Journal , 1965 : 116 - 120 .
0
浏览量
0
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构