期刊文献+

在线社交网络社区的启发式挖掘框架 被引量:3

Heuristic Framework for Mining Communities in Online Social Networks
下载PDF
导出
摘要 指出基于全局优化的社区挖掘方法的不足,给出OSNs网络及其社区挖掘的形式定义,提出一个启发式社区挖掘框架,在此框架下对包括LWP,Clauset,Schaeffer,Papadopoulos,Bagrow与Chen在内的6种启发式社区挖掘算法进行分析比较.通过3个真实OSNs网络的实验比较,验证了启发式社区挖掘框架的可行性,在结果社区有效性与时间效率上对6种启发式算法进行比较,实验结论为网络社区挖掘的工程实践与理论研究提供了借鉴. Limitations of communities mining approaches of global optimization are pointed out and formal definitions of OSNs network and OSNs network mining are given.A heuristic framework for mining communities is presented,under which six heuristic mining algorithms,i.e.LWP,Clauset,Schaeffer,Papadopoulos,Bagrow and Chen,are analyzed.Experiments on 3 real OSNs proved feasibility of the framework,and conclusion from comparing six heuristic algorithms on validity of resultant communities and time performance can be reference for engineering practice in network community discovery.
出处 《小型微型计算机系统》 CSCD 北大核心 2011年第12期2396-2399,共4页 Journal of Chinese Computer Systems
基金 福建省教育厅科技项目(JA10076)资助 国家自然科学基金与中国民用航空总局联合项目(60776816)资助 广东省自然科学基金重点项目(8251064101000005)资助
关键词 启发式 社区挖掘 在线社交网络 heuristic community mining online social network
  • 相关文献

参考文献22

  • 1Tantipathananandh C, Berger-Wolf T Y, Kempe D. A framework for comminity identification in dynamic social networks[ C]. KDD 2007,717-726.
  • 2Clauset A, Newman M E J, Moore C. Finding community structure in very large networks[J]. Phys. Rev. E,2004,70(6) :66-111.
  • 3Schaeffer S E. Stochastic local clustering for massive graphs[C]. PAKDD 2005 : 354-360.
  • 4Newman M E J. Fast algorithm for detecting community structure in networks[J]. Phys. Rev. E, 2004, 69(6): 66-133.
  • 5Lin Yu-ru, Chi Yun, Zhu Sheng-huo, et al. Facemet: a framework for analyzing communities and their evolutions in dynamic network [ C]. WWW, Beijing, China,April ,2008.
  • 6Chen J, Zaiane O R, Goebel R. Local community identification in social networks[ C]. ASONAM 2009: 237-242.
  • 7黄发良.信息网络的社区发现及其应用研究[J].复杂系统与复杂性科学,2010,7(1):64-74. 被引量:19
  • 8Clauset A. Finding local community structure in networks [ J]. Phys. Rev. E,2005,72(2) : 26-132.
  • 9Papadopoulos S, Skusa A, Vakali A, et al. Bridge bounding: a local approach for efficient community discovery in complex net-works[ J]. Eprint arXiv : 2009,0902.0871.
  • 10Radicchi F, Castellano C, Cecconi F,et al. Defining and identifying communities in networks[ J ]. PNAS ,21204,101 ( 9 ) :2658-2663.

二级参考文献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

同被引文献33

  • 1汪小帆,李翔,陈关荣.复杂网络理论及应用[M].北京:清华大学出版社,2006.
  • 2WASSEMAN S, FAUST K. Social network analysis [ M]. Cam- bridge: Cambridge University Press, 1994:32 - 35.
  • 3WATIS D J, STROQATZ S H. Collective dyramics of 'small-world' networks [ J]. Nature, 1998, 393(6684) : 440 -442.
  • 4NEWMAN M E J. The structure of scientific collaboration networks [ J]. The Structure of Scientific Collaboration Networks, 2001, 98 (2) : 404 - 409.
  • 5WILLIAMS R J, MARTINEZ N D. Simple rules yield complex food Webs[ J]. Nature, 2000, 404(6774) : 180 - 183.
  • 6FELL D A, WAGNER A. The small world of metabolism [ J]. Na- ture Biotechnology, 2000, 18(11) : 1121 - 1122.
  • 7FALOUTSOS M, FALOUTSOS P, FALOUTSOS C. On power-law relationships of the lntcrnet topology [ J]. Computer Communications Review, 1999, 29:251 - 262.
  • 8NEWMAN M E J. Fast algorithm for detecting community structure in networks [ J]. Physical Review E, 2004, 69(6) : 1 - 5.
  • 9ZHANG H, KE K, LI W, et al. Grahical models based hierarchi- cal probabilistic community discovery in large-scale social networks [ J]. International Journal of Data Mining, Modelling and Manage- ment, 2010, 2(2): 95-116.
  • 10LIU Y, LUO J, YANG H, et al. Finding closely communicating community based on ant colony clustering model [ C]// Proceed-ings of the 2010 International Conference on Artificial Intelligence and Computational Intelligence. Piscataway: IEEE Press, 2010: 127 - 131.

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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