全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2012 

社会网络中基于局部信息的边社区挖掘

DOI: 10.3969/j.issn.0372-2112.2012.11.018, PP. 2255-2263

Keywords: 社区挖掘,边社区,局部社区

Full-Text   Cite this paper   Add to My Lib

Abstract:

近年来,随着社交网络的发展,许多重叠社区挖掘算法被提出来.传统的方法都是将节点作为研究对象,而最近的一些研究表明,以边为研究对象的边社区挖掘方法相对于点社区挖掘方法来说具有更加明显的优势.因此,我们提出了基于局部边社区的挖掘算法(LLCM),利用网络中的局部信息去挖掘边社区结构.给定一条初始的边,通过不断最大化一个适应度函数来获取该边所在的局部社区,而这条初始的边可以预先通过一些排序算法进行选择.算法经过在计算机生成网络和真实网络上测试,并且同其他边社区挖掘算法进行了比较,实验结果表明LLCM算法获取了合理的边社区的结构.

References

[1]  杨博,刘大有,等.复杂网络聚类方法[J].软件学报,2009,20(1):54-66. B Yang,D Y Liu,et al.Complex network clustering algorithms [J].Journal of Software,2009,20(1):54-66.(in Chinese)
[2]  金弟,刘大友,等.基于局部探测的快速复杂网络聚类算法[J].电子学报,2011,30(11):2540-2546. D Jin,D Y Liu,et al.Fast complex network clustering algorithm using local detection [J].Acta Electronica Sinica,2011,30(11):2540-2546.(in Chinese).
[3]  黄健斌,孙鹤立,Dustin BORTNER,刘亚光.从链接密度遍历序列中挖掘网络社区的层次结构 .软件学报,2011,22(5):951-961. J B Huang,H L Sun,B Dustin,Y G Liu.Mining hierarchical community structure within networks from density-connected traveling orders [J].Journal of Software,2011,22(5):951-961.(in Chinese)
[4]  S White,P Smyth.A spectral clustering approach to finding communities in graphs .Kamath C,Goodman A,eds.Proceedings of the 5th SIAM International Conference on Data Mining .Philadelphia:SIAM,2005.76-84.
[5]  F Wu,B A Huberman.Finding communities in linear time:a physics approach [J].The European Physical Journal B-Condensed Matter and Complex Systems,2004,38(2):331-338.
[6]  H Zhou.Distance,Dissimilarity index,and network community structure [J].Physical Review E,2003,67(6):061901.
[7]  M Girvan,M E J Newman.Community structure in social and biological networks .Proceedings of National Academy of Science of the United States of America,2002,99:7821-7826.
[8]  M E J Newman,M Girvan.Finding and evaluating community structure in networks .Physical Review E,2004,69:026113.
[9]  M E J Newman.Fast algorithm for detecting community structure in networks [J].Physical Review E,2004,69:066133.
[10]  F Radicchi,C Castellano,F Cecconi,V Loreto,D Parisi.Defining and identifying communities in networks [J].Proceedings of the National Academy of Sciences of the United States of America,2004,101(9):2658-2663.
[11]  J Duch,AArenas.Community detection in complex networks using extremal optimization [J].Physical Review E,2005,72(2):027104.
[12]  D Jin,D X He,et al.Genetic algorithm with local search for community mining in complex networks .Proceedings of IEEE International Conference on Tools with Artificial Intelligence .Arras,France:IEEE,2010.105-112.
[13]  C Pizzuti.A multi-objective genetic algorithm for community detection in networks .Proceedings of IEEE International Conference on Tools with Artificial Intelligence .Newark,New Jersey,USA:IEEE,2009.379-386.
[14]  V D Blondel,J L Guillaume,et al.Fast unfolding of communities in large networks [J].Journal of Statistical Mechanics:Theory and Experiment,2008,10:P10008.
[15]  A Lancichinetti,S Fortunato,J Kertész.Detecting the overlapping and hierarchical community structure in complex networks [J].New Journal of Physics,2009,11(3):033015.
[16]  A McDaid,N Hurley.Detecting highly overlapping communities with model-based overlapping seed expansion .Proceedings of International Conference on Advances in Social Networks Analysis and Mining .Odense,Denmark:IEEE,2010.112-119.
[17]  S Gregory.An algorithm to find overlapping community structure in networks .Proceedings of PKDD 2007 .Warsaw,Poland:IEEE,Lecture Notes in Computer Science,2007,4702(12):91-102.
[18]  M Rosvall,D Axelsson,C T Bergstrom.The map equation [J].The European Physical Journal-Special Topics,2009,178(1):13-23.
[19]  Y Kim,H Jeong.The map equation for link community [J].Physical Review E,2011,84:026110.
[20]  M E J Newman.Modularity and community structure in networks [J].Proceedings of the National Academy of Sciences,2006,103:8577-8582.
[21]  M E J Newman.Finding community structure in networks using the eigenvectors of matrices.[J].Physical Review E,2006,74(3):036104.
[22]  S Fortunato,M Barthélemy.Resolution limit in community detection [J].Proceedings of the National Academy of Sciences,2007,104(1):36-41.
[23]  W WZachary.An information flow model for conict and fission in small groups .Anthropological Research,1977,33:452-473.
[24]  D Lusseau.The emergent properties of a dolphin social network [J].Proceedings of the Royal Society of London,Series B:Biological Sciences,2003,270(2):S186-188.
[25]  B W Kernighan,S Lin.An efficient heuristic procedure for partitioning graphs .The Bell system technical journal,1970,49(1):291-307.
[26]  M Belkin,P Niyogi.Laplacian eigenmaps and spectral techniques for embedding and clustering .Advances in Neural Information Processing Systems .Vancouver,Canada:MIT Press,2001,14:585-591.
[27]  P Pons,M Latapy.Computing communities in large networks using random walks .Proceedings of Computer and Information Sciences,-ISCIS 2005 .Berlin,Heidelberg:SpringerVerlag,2005,3733(31):284-293.
[28]  R Guimera,L A NunesAmaral.Functional cartography of complex metabolic networks [J].Nature,2005,433(7028):895-900.
[29]  G Palla,I Derenyi,I Farkas,T Vicsek.Uncovering the overlapping community structure of complex networks in nature and society [J].Nature,2005,435(7043):814-818.
[30]  T S Evans.Clique graphs and overlapping communities [J].Journal of Statistical Mechanics:Theory and Experiment,2010,12:P12037+.
[31]  H Shen,X Cheng,et al.Detect overlapping and hierarchical community structure in networks [J].Physica A:Statistical Mechanics and its Applications,2009,388(8):1706-1712.
[32]  C Lee,F Reid,AMcDaid,N Hurley.Detecting highly overlapping community structure by greedy clique expansion .Proceedings of SNA-KDD Workshop .Washington DC,USA:IEEE,2010.33-42.
[33]  J P Bagrow,E M Bollt.Local method for detecting communities [J].Physical Review E,2005,72(4):046108+.
[34]  F Havemann,M Heinz,et al.Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels [J].Journal of Statistical Mechanics:Theory and Experiment,2011,01:P01023+.
[35]  B Karrer,M E J Newman.Stochastic blockmructure in networks [J].Physical Review E,2011,83(1):016107+.
[36]  B Ball,B Karrer,M E J Newman.An efficient and principled method for detecting communities in networks [J].Physical Review E,2011,84:036103.
[37]  T S Evans,R Lambiotte.Line graphs,link partitions,and overlapping communities .Physical Review E (Statistical,Nonlinear,and Soft Matter Physics),2009,80(1):016105+.
[38]  Y YAhn,J P Bagrow,S Lehmann.Link communities reveal multi-scale complexity in networks [J].Nature,2010,466:761-764.
[39]  A Lancichinetti,S Fortunato,F Radicchi.Benchmark graphs for testing community detection algorithms [J].Physical Review E,2008,78(4):046110+.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133