期刊文献+

一种基于用户交互行为和相似度的社交网络社区发现方法研究 被引量:11

Research on Community Detection Method for Social Networks Based on User Interaction and Similarity
下载PDF
导出
摘要 随着复杂社交网络的深入发展,有关社交网络社区发现算法的研究也在不断推陈出新,目前有关社区发现算法的研究大多只利用到网络中单个维度的信息。文章提出一种综合考虑用户交互行为和相似度的社区发现方法,通过有效融合多维信息,在社交网络中探测出社区结构。该方法将网络中用户之间的多维关联概括为交互行为和相似度,使用加入相似性惩罚因子的相似模块度作为目标函数来指导社区的划分。在真实数据集上的实验结果表明,该方法不仅能够体现网络中的动态变化,而且还能得到联系紧密、属性相似的节点集合,证明了方法的合理性和有效性。 With the development of ihe complex social networks, researches on algorithms about social networks community detection also develop constantly. Researches on algorithms about social networks community detection only take advantage of single dimension information of the network. This paper presents a community detection method that considers user interaction and the similarity comprehensively, detecting community structure in social network by mixing together multiple dimensions information effectively. The method summarizes multi-dimensional relations between users as interaction and similarity .using similarity modularity that is added similarity penalty factor as object function to guide the community division. Experimental results on real data sets show that the method not only can reflect the dynamic changes in the network, but also can get closely linked collection of nodes with similar attributes, proving the rationality and effectiveness of the method.
出处 《信息网络安全》 2015年第7期77-83,共7页 Netinfo Security
基金 国家自然科学基金[61402112] 福建省安全课题[828398]
关键词 社交网络 社区发现 相似模块度 social networks community detection similarity modularity
  • 相关文献

参考文献22

  • 1Mccallum A, Corrada-Emmanuel A, Wang X. Topic and role discovery in social networks[J]. Ijcai, 2005, 30(2):786-791.
  • 2Yin B, Yang Y, Liu W. Exploring social activeness and dynamic interest in community-based recommender system[C]//Proceedings of the companion publication of the 23rd international conference on World wide web companion. International World Wide Web Conferences Steering Committee, 2014: 771-776.
  • 3Zhang W, Wang J, Feng W. Combining latent factor model with location features for event-based group recommendation[C]//Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2013: 910-918.
  • 4Lu Z, Wen Y, Cao G. Community detection in weighted networks: Algorithms and applications[C]//Pervasive Computing and Communications (PerCom), 2013 IEEE International Conference on. IEEE, 2013: 179-184.
  • 5Shakarian P, Roos P, Callahan D, et al. Mining for geographically disperse communities in social networks by leveraging distance modularity[C]//Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2013: 1402- 1409.
  • 6Corneil D G, Gotlieb C C isomorphism[J]. Journal of the 64. An efficient algorithm for graph ACM (JACM), 1970, 17(1): 51- 64.
  • 7Pothen A, Simon H D, Liou K P. Partitioning sparse matrices with eigenvectors of graphs[J]. SIAM Journal on Matrix Analysis and Applications, 1990, 11 (3): 430-452.
  • 8Girvan M, Newman M E J. Community structure in social and biological networks[C]//Proceedings of the National Academy of Sciences, 2002, 99(12): 7821-7826.
  • 9Newman M E. Fast algorithm for detecting community structure in networks[J]. Physical Review E, 2004, 69(6):279-307.
  • 10Clauset A, Newman M E J, Moore C. Finding community structure in very large networks[J]. Physical Review E, 2004, 70(6):264-277.

二级参考文献16

  • 1高琰,谷士文,唐琎.基于链接分析的Web社区发现技术的研究[J].计算机应用研究,2006,23(7):183-185. 被引量:17
  • 2Newman MEJ.The structure and function of complex networks. SIAM Review . 2003
  • 3Albert R,Barabasi AL.Statistical mechanics of complex networks. Reviews of Modern Physics . 2002
  • 4Fiedler M.Algebraic connectivity of graphs. Czechoslovak Mathematical Journal . 1973
  • 5Pothen A,Simon H D,Liou K P.Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Computing . 1990
  • 6Kernighan BW,Lin S.An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, The . 1970
  • 7Girvan M,Newman MEJ.Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America . 2002
  • 8Radicchi F,Castellano C,Cecconi F,et al.Defining and identifying communities in networks. Proceedings of the National Academy of Sciences of the United States of America . 2004
  • 9S. Fortunato.Community detection in graphs. Physics Reports . 2010
  • 10Alba R.A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology . 1973

共引文献51

同被引文献86

  • 1朱亚丽.“六度分离”假说的信息学意义[J].图书情报工作,2005,49(6):59-61. 被引量:18
  • 2刘威,唐常杰,乔少杰,温粉莲,左劼.基于概念邮件系统的犯罪数据挖掘新方法[J].计算机科学,2007,34(2):213-215. 被引量:4
  • 3解,汪小帆.复杂网络的一种快速局部社团划分算法[J].计算机仿真,2007,24(11):82-85. 被引量:13
  • 4AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases [J]. ACM SIGMOD Record, 1993, 22(2): 207-216.
  • 5SAVASERE A, OMIECINSKI E, NAVATHE S B. An Efficient Algorithm for Mining Association Rules in Large Databases[C]//21th International Conference on Very Large Data Bases, San Francisco, CA, USA, 1995: 432-444.
  • 6TIOVONEN H. Sampling Large Databases for Association Rules[C]//22th International Conference on Very Large Data Bases, San Francisco, CA, USA, 1996: 134-145.
  • 7CRESTANA-JENSEN V, SOPARKAR N. Frequent Itemset Counting Across Multiple Tables[C]//4th Pacific-Asia Conference, PAKDD 2000, Kyoto, Japan, 2000: 49-61.
  • 8BAY S D, PAZZANI M J. Detecting Group Differences: Mining Contrast Sets[J]. Data Mining & Knowledge Discovery, 2002, 5(3): 213-246.
  • 9AGARWAL R C, AGGARWAL C C, PRASAD V V V. A Tree Projection Algorithm For Generation Of Frequent Itemsets[J]. Journal of Parallel & Distributed Computing, (Special Issue on High Performance Data Mining), 2000, 61(3): 350-371.
  • 10ZHANG G L, LEI J S, WU x H. An hnproved Apriori Algorithm for Mining Association Rules[J]. Microelectronics & Computer, 2010, 23(2): 10-12.

引证文献11

二级引证文献37

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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