期刊文献+

面向多源社交网络的社团结构特征研究 被引量:3

Research on Community Characteristics of Multi-source Social Network
下载PDF
导出
摘要 为了研究社交网络社团结构对舆情传播的影响,本文对比分析了多源社交网络的社团结构特性及传播特性,并且利用COPRA算法和LFM算法进行了社交网络重叠社团研究,提出一种基于节点度过滤的LFM改进方法——NF-LFM算法。该算法先对好友关系网络中节点度小于某一阈值的节点进行过滤,再对剩下的好友关系网络进行社团划分。研究发现:1)人人网、QQ空间、新浪微博都具有明显的社团结构特性,其中,人人网和QQ空间的社团结构特性强于新浪微博;2)在不考虑社交网络用户活跃度的情况下,舆情信息在人人网上扩散范围最广,新浪微博次之,QQ空间扩散较慢。本文提出的改进方法能解决现有算法社团划分结果分辨率低的问题,且有效弥补了LFM算法在大规模社团发现时陷入无限迭代过程而导致时间复杂度高的缺点,将其应用于经典数据集中也符合理论预期结果。本文的研究结果将有助于进一步理解和认识社交网络社团结构对舆情传播的影响,同时对于网络群体事件发现和舆情监控及引导等具有重要意义。 In order to analyze the impact of social networks on the spread of public opinion,the multi-source network community structure characteristics and its propagation characteristics was studied. Furthermore,the overlapping community was discussed using COPRA algorithm and LFM algorithm in social network and the improved algorithm of LFM based on filtering node degree,named as NF-LFM algorithm,was proposed. In this algorithm,the node with node degree less than a certain threshold in the friend relation network was filtered,and then the rest of the network was divided into community structure. The results showed that the social networks such as Renren,Qzone and Microblog had obvious characteristics of the community structure,of which Renren and Qzone was stronger than Microblog. Without taking into account the user activity,the diffusion range of public opinion information in Renren was larger than the others.The proposed method could not only solve the resolution problem of the existing algorithm in the community division results effectively,but also make up for the shortcomings of the LFM algorithm,which was caught in an infinite iterative process and leads to high time complexity. It was also in line with expected results when it was applied to the classical data set. The results can help researchers understand the impact on public opinion spread in community. It also has important significance for the discovery of network group incidents and guidance of public sentiment.
出处 《四川大学学报(工程科学版)》 CSCD 北大核心 2017年第S2期195-202,共8页 Journal of Sichuan University (Engineering Science Edition)
基金 国家科技支撑计划资助项目(2012BAH18B05) 国家自然科学基金资助项目(61272447) 四川大学青年教师启动基金资助项目(2015SCU11079)
关键词 社交网络 社团发现 重叠社团 NF-LFM算法 节点度 social network community detection overlapping community NF-LFM algorithm node degree
  • 相关文献

参考文献6

二级参考文献54

  • 1胡海波,王林.幂律分布研究简史[J].物理,2005,34(12):889-896. 被引量:87
  • 2杨博,刘大有.Force-Based Incremental Algorithm for Mining Community Structure in Dynamic Network[J].Journal of Computer Science & Technology,2006,21(3):393-400. 被引量:8
  • 3Zhang Tian,Ramakrishnan R,Livny M.Birch:A New Data Clustering Algorithm and Its Applications.Data Mining and Knowledge Discovery,1997,1(2):141-182.
  • 4MacQueen J.Some Methods for Classification and Analysis of Multivariate Observations//Proc of the 5th Berkeley Symposium on Mathematical Statistics and Probability.Berkeley,USA,1967,Ⅰ:281-297.
  • 5Ester M,Riegel H P,Sander J,et al.A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise//Proc of the 2nd International Conference on Knowledge Discovery and Data Mining.Portland,USA,1996:291-316.
  • 6Ding C,He Xiaofei.k-Nearest-Neighbor Consistency in Data Clustering:Incorporating Local Information into Global Optimization//Proc of the ACM Symposium on Applied Computing.Nicosia,Cy-prus,2004:584-589.
  • 7Fr(a)nti P,Virmajoki O,Hautam(a)ki V.Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph.IEEE Trans on Pattern Analysis and Machine Intelligence,2006,28(11):1875-1881.
  • 8Zhu Qiaoming,Li Jnnhui,Zhou Guedong,et al.A Novel Hierarchical Document Clustering Algorithm Based on a kNN Connection Graph//Proc of the 21st International Conference on the Computer Processing of Oriental Languages.Singapore,Singapore,2006:120-130.
  • 9Teng S H,Yao F F.k-Nearest-Neighbor Clustering and Percolation Theory.Algorithmica,2007,49(3):192-211.
  • 10刘大有,刘杰,金弟.基于k最近邻划分的聚类算法研究//中国人工智能进展2007.哈尔滨,2007:169-174.

共引文献183

同被引文献17

引证文献3

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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