期刊文献+

基于局部扩充优化的重叠社群检测方法的改进 被引量:1

Improvement of overlapping community detection based on local expansion and optimization
下载PDF
导出
摘要 生物信息学、社会网络、Web分析等方面的发展积累了大量的复杂网络数据信息,在对这些复杂网络进行社群检测时,往往会将一些节点归类于多个社群,目前已经提出了一些处理此类问题的算法(如LFK、GCE等),然而这类算法对局部扩充函数中参数α的选取过程复杂,无法一次性获取最优α,直接影响到了算法的可应用性。针对该缺点,提出了一种基于局部扩展的重叠社群检测的改进算法。该算法通过将α参数考虑进社群的成长过程中,使算法在保持原有速度与精度的情况下自适应地选取最优α。 Large amounts of complex networks data have been accumulated in the development of bioinformatics,social networks,Web analysis,etc. This paper tended to classify some of the nodes into multiple communities for some complex network community detection. Recently,scholars raised the issue of such processing algorithms( such as LFM,GCE,etc.). However,this kind of algorithm couldn't obtain the optimal α in one time and it had a complex process while selecting parameter α in the local expansion function which directly affected the applicability of the algorithm. To get rid of the shortage,this paper presented an improved method based on local expanding to detect overlapping community. In this method,it considered α in the growth process of communities,so that it could select parameter α in an adaptive waywhile maintaining the speed and accuracy.
作者 王茜 张晨
出处 《计算机应用研究》 CSCD 北大核心 2015年第4期1056-1059,1064,共5页 Application Research of Computers
关键词 数据挖掘 重叠社群检测 局部聚类 data mining overlapping community detection local clustering
  • 相关文献

参考文献18

  • 1FORTUNATO S. Community detection in graphs [ J]. Physics Re- ports, 2010, 486(3) : 75-174.
  • 2HANJia.wai,KAMBERM.数据挖掘:概念与技术[M].北京:机械工业出版社,2001:300-403.
  • 3XIE Jie-rui, KELLEY S, SZYMANSKI B K. Over lapping community detection in networks: the state of the art and comparative study[ J ]. ACM Computing Surveys, 2013, 45(4) : 1-37.
  • 4LANCICHINETTI A, FORTUNATO S, KERTESZ J. Detecting the overlapping and hierarchical community structure in complex networks [J]. New Journal of Physics, 2009, 11 (3) : 033015.
  • 5LEE C, REID F, McDAID A, et al. Detecting highly over lapping community structure by greedy clique expansion[ C]//Proe of the 4th SNA-KDD Workshop. 2010.
  • 6WU Bin, YANG Sheng-qi, ZHAO Hai-zhou, et al. A distributed al- gorithm to enumerate all maximal cliques in MapReduce[ C ]//Proc of the 4th International Conference on Frontier of Computer Science and Teehnolgy. [S. 1. ] : IEEE Press, 2009: 45-51.
  • 7BAUMES J, GOLDBERG M K, KRISHNAMOORTHY M S, et al. Finding communities by clustering a graph into overlapping subgraphs [ C ]//Proc of IADIS International Conference on Applied Computing. 2005 : 97-104.
  • 8LEE C, REID F, McDAID A, et al. Seeding for pervasively over lap- ping communities [ J ]. Physical Review E, 2011, 83 ( 6 ) : 066107.
  • 9BRON C, KERBOSCH J. Algorithm 457 : finding all cliques of an un- directed graph [ J ]. Communications of the ACM, 1973,16 ( 9 ) : 575- 577.
  • 10CLAUSET A. Finding local community structure in networks [ J ]. Physical Review E, 2005,72(2) :026132.

同被引文献5

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部