期刊文献+

引入时间机制的网络舆情演化分析方法研究 被引量:3

Research on Evolution of Network Public Opinion Introducing Time Mechanism
下载PDF
导出
摘要 网络舆情的迅速发展使舆情发展成为研究热点,它对舆情的预测预警具有重要意义。从文本聚类入手,针对舆情的演化分析过程,在时间序列上进行K-means聚类研究,得到聚类中心,又依此对聚类中的词频统计进行时序加权处理,使统计所得关键词更具有代表性。通过对时间聚类法和时序加权统计法所得关键词的分析,得到了舆情演化的趋势。研究结果表明该方法降低了聚类的维数,减少了噪声,提高了聚类的准确度,增强了演化分析的可信度。 The rapid development of network public opinion makes the evolution of public opinion become the research hotspot,which is of great significance for the forecast of public opinion.In this paper,we started from text clustering,for the evolution of public opinion analysis process,making the K-means clustering research in time series,and got clustering center.The time-weighted weighting of word frequency statistics in clustering was made,which makes the statistical keywords more representative.Through the analysis of the keywords obtained by time clustering and time series weighted statistical method,the trend of public opinion evolution was got.The results show that the method reduces the dimension of clustering and the noise,improves the accuracy of clustering,and enhances the reliability of evolution analysis.
出处 《计算机科学》 CSCD 北大核心 2017年第B11期418-421,共4页 Computer Science
关键词 网络舆情 时间聚类 加权 关键词 演化分析 Network public opinion Time clustering Weighting Keywords Evolutionary analysis
  • 相关文献

参考文献4

二级参考文献25

  • 1张旻,张燕平,程家兴.时间序列相似模式的分层匹配[J].计算机辅助设计与图形学学报,2005,17(7):1480-1485. 被引量:6
  • 2常建娥,蒋太立.层次分析法确定权重的研究[J].武汉理工大学学报(信息与管理工程版),2007,29(1):153-156. 被引量:600
  • 3Kim S W, Park D H, Lee H G. Efficient Processing of Subsequence Matching with the Euclidean Metric in Time-Series Databases. Information Processing Letters, 2004, 90 (5) : 253 - 260.
  • 4Kontaki M, Papadopoulos A N, Manolopoulos Y. Adaptive Similarity Search in Streaming Time Series with Sliding Windows. Data & Knowledge Engineering, 2007, 63 (2): 478- 502.
  • 5Peng Z K, Tse P W, Chu F L. An Improved Hilbert-Huang Transform and Its Application in Vibration Signal Analysis. Journal of Sound and Vibration, 2005, 286(1/2) : 187 -205.
  • 6Keogh E, Chu S, Hart D, et al. An On-line Algorithm for Segmenting Time Series // Proc of the IEEE International Conference on Data Mining. San Jose, USA, 2001 : 289 -296.
  • 7Keogh E, Kasetty S. On the Need for Time Series Data Mining Benchmarks : A Survey and Empirical Demonstration// Proc of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Edmonton, Canada, 2002:102 - 111.
  • 8Ordonez C, Omiecinski E. Efficient Disk-Based K-means Clustering for Relational Databases. IEEE Trans on Knowledge and Data Engineering, 2004, 16(8) : 909 -921.
  • 9Zhang Yan, Sun Zhengxing, Li Wenhui. Texture Synthesis Based on Direction Empirical Mode Decomposition. Computers & Graphics, 2008, 32(2): 175-186.
  • 10Last M, Klein Y, Kandel A. Knowledge Discovery in Time Series Databases. IEEE Trans on Systems, Man and Cybernetics , 2001, 31(1): 160-169.

共引文献30

同被引文献25

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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