期刊文献+

基于RNN和主题模型的社交网络突发话题发现 被引量:15

Social network bursty topic discovery based on RNN and topic model
下载PDF
导出
摘要 社交网络数据是稀疏和嘈杂的,并伴有大量的无意义话题。传统突发话题发现方法无法解决社交网络短文本稀疏性问题,并需要复杂的后处理过程。为了解决上述问题,提出一种基于循环神经网络(RNN,recurrent neural network)和主题模型的突发话题发现(RTM-SBTD)方法。首先,综合RNN和逆序文档频率(IDF,inverse document frequency)构建权重先验来学习词的关系,同时通过构建词对解决短文本稀疏性问题。其次,模型中引入针板先验(spike and slab)来解耦突发话题分布的稀疏和平滑。最后,引入词的突发性来区分建模普通话题和突发话题,实现突发话题自动发现。实验结果表明与现有的主流突发话题发现方法相比,所提RTM-SBTD方法在多种评价指标上优于对比算法。 The data is noisy and diverse,with a large number of meaningless topics in social network.The traditional method of bursty topic discovery cannot solve the sparseness problem in social network,and require complicated post-processing.In order to tackle this problem,a bursty topic discovery method based on recurrent neural network and topic model was proposed.Firstly,the weight prior based on RNN and IDF were constructed to learn the relationship between words.At the same time,the word pairs were constructed to solve the sparseness problem.Secondly,the“spike and slab”prior was introduced to decouple the sparsity and smoothness of the bursty topic distribution.Finally,the burstiness of words were leveraged to model the bursty topic and the common topic,and automatically discover the bursty topics.To evaluate the effectiveness of proposed method,the various experiments were conducted.Both qualitative and quantitative evaluations demonstrate that the proposed RTM-SBTD method outperforms favorably against several state-of-the-art methods.
作者 石磊 杜军平 梁美玉 SHI Lei;DU Junping;LIANG Meiyu(Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia,Beijing University of Posts and Telecommunications,Beijing 100876,China)
出处 《通信学报》 EI CSCD 北大核心 2018年第4期189-198,共10页 Journal on Communications
基金 国家自然科学基金资助项目(No.61320106006 No.61532006 No.61772083)~~
关键词 社交网络 突发话题发现 主题模型 循环神经网络 social network bursty topic discovery topic model RNN
  • 相关文献

参考文献5

二级参考文献235

  • 1邢修三.非平衡统计信息理论[J].物理学报,2004,53(9):2852-2863. 被引量:19
  • 2Erd?s P, Rényi A. On random graphs. Publ Math, 1959, 6: 290-297.
  • 3Watts D J, Strogatz S H. Collective dynamics of ‘small-world' networks. Nature, 1998, 393: 440-442.
  • 4Barabási A L. Emergence of scaling in random networks. Science, 1999, 286: 509-512.
  • 5Leskovec J, Adamic L, Huberman B. The dynamics of viral marketing. ACM Trans Web, 2007, 1: 5.
  • 6Liben-Nowell D, Kleinberg J. The link prediction problem for social networks. J Am Soc Inf Sci Technol, 2007, 58: 1019-1031.
  • 7Kempe D, Kleinberg J, Tardos E. Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'03), 2003. 137-146.
  • 8Fowler J H, Christakis N A. Dynamic spread of happiness in a large social network: Longitudinal analysis over 20 years in the framingham heart study. British Med J, 2008, 337: a2338.
  • 9Tang J, Sun J, Wang C, et al. Social influence analysis in large-scale networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'09), 2009. 807-816.
  • 10Sun J, Tang J. A survey of models and algorithms for social influence analysis. In: Social Network Data Analytics. Berlin: Springer, 2011. 177-214.

共引文献63

同被引文献227

引证文献15

二级引证文献92

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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