期刊文献+

基于Citespace的复杂网络可视化研究图谱 被引量:30

Knowledge Maps of Complex Network Visualization Based on Citespace
下载PDF
导出
摘要 当今万维网、社会网等复杂网络规模的迅猛发展,传统的文字和表格形式已无法满足日益庞大的网络数据的分析和管理,而可视化技术作为一种有效的辅助理解复杂网络的结构并从中挖掘有用信息的方法而得到广泛应用.本文以Web of Science数据库中关于复杂网络可视化的文献为研究对象,利用Citespace软件绘制出该领域的相关知识图谱,研究结果直观的展示了该研究领域主要国家、主要机构、核心期刊;揭示了复杂网络可视化研究领域由理论研究到实证研究、方法探索到实际应用的演进路径;指出可视化算法、可视化工具的研究等为热点,社会网络分析、数据挖掘等研究为前沿,为更快、更好的了解复杂网络可视化研究领域基础及研究进展提供有价值的参考. With the rapid development of the scale of complex network, such as WWW network, social network, the traditional way of text and form to describe network can not meet the requirement of analyzing and managing the growing power of network data, but as an effective method to assist us in understanding the structure of networks and mining useful information, visible technology are widely applied. Choosing the literature of the theme on the complex network visualization in Web of Science database as the studying object, map out the knowledge maps of the reach field by using Citespace. The result showed the major countries, institutions and Core Journal; revealed the evolution paths of complex network visualization research from theory research to empirical research, exploring methods to the practical application; pointed out the reach hotspots were visualization tool, algorithm etc; the reach fronts were social network analysis, data mining etc. This paper can provide valuable reference for faster and better understanding the intellectual bases and research progress of the complex network visualization.
出处 《计算机系统应用》 2014年第2期7-16,35,共11页 Computer Systems & Applications
关键词 复杂网络 可视化 CITESPACE 知识图谱 演进路径 研究热点和前沿 complex network visualization Citespace knowledge maps evolution paths research hotspots and fronts
  • 相关文献

参考文献55

  • 1ErdOs P, R6nyi A. On random graphs I. Publ. Math. Debrecen, 1959, 6: 290-297. 被引量:1
  • 2Watts D J, Strogatz SH. Collective dynamics of 'small-world' networks. Nature, 1998, 393(6684): 440-442. 被引量:1
  • 3Barabtsi AL, Albert R. Emergence of scaling in random networks. Science, 1999, 286(5439): 509-512. 被引量:1
  • 4Strogatz SH. Exploring complex networks. Nature, 2001, 410(6825): 268-276. 被引量:1
  • 5Ahrned A, Dywer T, Hong SH, et al. Visualisation and analysis of large and complex scale-free networks. Proc. of the Seventh Joint Eurographics/IEEE VGTC Conference onVisualization. Switzerland. 2005. 239-246. 被引量:1
  • 6Eades E A heuristic for graph drawing. Congresses Numerantium, 1984, 42: 149-160. 被引量:1
  • 7Kamada T, Kawai S. An algorithm for drawing general undirected graphs. Information Processing Letters, 1989, 31(1): 7-15. 被引量:1
  • 8Fruchterman TMJ, Reingold EM. Graph drawing by force - directed placement. Software: Practice and Experience, 1991, 21(11): 1129-1164. 被引量:1
  • 9Feder T, Motwani R. Clique partitions, graph compression and speeding-up algorithms. Proc. of the Twenty-Third Annual ACM Symposium on Theory of Computing. New York, ACM New York. 1991. 123-133. 被引量:1
  • 10Adler M, Mitzenmacher M. Towards compressing web graphs. Data Compression Conference. 2001. NW Washington. IEEE Computer Society. 2001. 203-212. 被引量:1

二级参考文献294

共引文献493

同被引文献392

引证文献30

二级引证文献174

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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