期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

用于网络重叠社区发现的粗糙谱聚类算法 被引量：7

Rough Spectral Clustering Algorithm Applied to Overlapping Network Communities Discovery
在线阅读 下载PDF
导出
摘要 针对绝大多数社区发现算法都存在着网络节点仅隶属于一个社区的假设,引入谱图理论与粗糙集理论来分析复杂网络社区,提出一种用于网络重叠社区发现的粗糙谱聚类算法RSC,该算法用上下近似来刻画网络节点的社区归属,边界表示社区之间共享的节点,通过优化重叠社区结构模块度来实现重叠社区发现.通过3个不同类型真实网络的仿真实验,结果验证了该方法的可行性与有效性. Given the fact that the vast majority of Algorithms for communities discovery assume that one network node belongs to only one community, spectral graph theory and rough set theory are introduced into analysis of community structures in complex networks, an algorithm RSC, which is used in discovering overlapping communities, is proposed. The basic idea of RSC is to describe commu- nities membership of network nodes with lower, and upper approximation, describe the network nodes shared by different communities with boundary, and to mine overlapping network communities by optimizing overlapping community modularity. Experimental results on 3 real networks from different domains indicated feasibility and validity of our approach.
作者 黄发良 肖南峰
机构地区 华南理工大学计算机科学与工程学院 福建师范大学软件学院
出处 《小型微型计算机系统》 CSCD 北大核心 2012年第2期263-266,共4页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61171141)资助 国家自然科学基金与中国民用航空总局联合项目(60776816)资助 广东省自然科学基金重点项目(8251064101000005)资助 福建省教育厅科研基金项目(JA10076)资助
关键词 重叠社区结构 谱映射 粗糙聚类 复杂网络 overlapping communities spectral mapping rough clustering complex networks
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献14

  • 1John W P, David R W. Betwe~nncss-bascd decomposition methods for social and biological networks[ M]. Le~s University Press, 2007 : 87 -90.
  • 2Perona P, Freeman W T. A factorization approach to grouping [ C]. ECCV, 1998,(1):655-670.
  • 3Ng A Y, Jordan M I, Weiss Y. On spectral clustering: analysis and an algorithm[ C]. NIPS,2001:849-856.
  • 4Gregory S. An algorithm to find overlapping community structure in networks[ C]. PKDD ,2007 : 91-102.
  • 5Meila M, Shi J. Learning segmentation by random walks[ C]. Learning Segmentation by Random Walks, NIPS ,2000 : 873-879.
  • 6Lingras P. Applications of rough set based K-means, kohonen, GA clustering[ M]. Transactions on Rough Sets VII, Springer - Verlag Berlin, Heidelberg,2007.
  • 7Ding C, He X, Zha H, et al. A rain-max cut algorithm for graph partitioning and data clustering [ C ]. ICDM, 2001 : 107 - 114.
  • 8Wang X, Jiao L, Wu J. Adjusting from disjoint to overlapping community detection of complex networksE J]. Physica A: Statisti- cal Mechanics and its Applications, 2009, 388(24) :5045-5056.
  • 9Palla G, Derenyi I, Farkas I, et al. Uncovering the overlapping conununity structure of complex networks in nature and society [J]. Nature. 2005. 435(7043) :814-818.
  • 10Shen H, Cheng X, Cai K, et al. Detect overlapping and hierarchi- cal community structure in networks [ J ]. Physica A: Statistical Mechanics and its Applications, 2008,388(8) :1706-1712.

二级参考文献57

  • 1Luce R D,Perry A D. A method of matrix analysis of group structure[J]. Psychometrika,1949,14(2) : 95 -116.
  • 2Alba R D. A graph-theoretic definition of a sociometric clique[ J]. J Math Sociol, 1973,3 (1) : 113 -126.
  • 3Luce R D. Connectivity and generalized cliques in sociometric group structure[J]. Psychometrika, 1950, 15 (2) :169 -190.
  • 4Mokken R J. Cliques, clubs and clans[J]. Quality and Quantity, 1979,13(2) : 161 - 173.
  • 5Seidman S B, Foster B L. A graph-theoretic generalization of the clique concept[ J]. J Math Sociol. 1978, 6:139 -154.
  • 6Seidman S B. Network structure and minimum degree[ J]. Soc Netw, 1983,5:269 -287.
  • 7Luccio F, Sami M. On the decomposition of networks into minimally interconnected networks[ J]. IEEE Trans Circuit Theory, 1969, 2(16) : 184 -188.
  • 8Radicchi F, Castellano C, Cecconi F, et al. Defining and identifying communities in networks[J]. PNAS, 2004, 101 (9): 2658 - 2663.
  • 9Hu Y Q, Chen H B, Zhang P, et al. Comparative definition of community and corresponding identifying algorithm[J]. Phys Rev E, 2008, 78(2) :026121.
  • 10Guimera R, Sales-Pardo M, Amaral L A N. Modularity from fluctuations in random graphs and complex networks[ J ]. Phys Rev E, 2004, 70(2) : 025101.

共引文献18

同被引文献111

  • 1张金隆,杜小芳,张思华.农产品物流配送系统结构研究[J].中国管理科学,2003,11(z1):403-405. 被引量：7
  • 2宋明秋,张瑞雪.基于HTML树的网页结构相似度研究[J].情报学报,2011,30(2):160-165. 被引量：2
  • 3王丽娟,关守义,王晓龙,王熙照.基于属性权重的Fuzzy C Mean算法[J].计算机学报,2006,29(10):1797-1803. 被引量：47
  • 4ROSVALL M. Information horizons in a complex world [ D ]. Umea : Umea University, 2006.
  • 5WATTS D J, STROGATZ S H. Collective dynamics of ' small world' networks[ J]. Nature, 1998,393(6684) :440-442.
  • 6BARABASI A L, BONABEAU E. Scale-free networks [ J ]. Scientific American ,2003,288(5 ) :60-69.
  • 7FORTUNATO S. Community detection in graphs [ J]. Physics Re- ports ,2010,486:75-174.
  • 8GIRVAN M, NEWMAN M E J. Community structure in social and bio- logical networks [ J ]. Proceedings of the National Academy of Sciences, 2002,99 ( 12 ) : 7821 - 7826.
  • 9NEWMAN M E J, GIRVAN M. Finding and evaluating community structure in networks [ J ]. Physical Review E, 2004, 69 ( 2 ) : 026113.
  • 10KRISHNAMURTHY B, WANG Jia. On network-aware clustering of Web clients[ C ]//Proc of Conference on Applications, Technologies, Architectures and Prot0cols for Computer Communication. New York: ACM Press ,2000:97,110.

引证文献7

二级引证文献48

小型微型计算机系统
2012年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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