|
|
|
| Design and Implementation of a Visual Analytical Platform for Dynamic Link Analysis |
| Ma Chao Ye Qi Wu Bin Shi Chuan She Ying |
（School of Computer Science and Technology, Beijing University of Posts and Telecommunications,
Beijing 100876, China） |
|
|
|
|
Abstract This paper proposes a visual analytical framework named NeSVA based on link analysis. With the help of NeSVA, the analysts can explore the structure information of networks and gain deep insights from massive dynamic link data by providing timely, defensible and understandable assessments for dynamic network analysis.
|
|
Received: 28 April 2010
Published: 26 July 2010
|
|
|
| Fund: *本文系国家自然科学基金资助项目“基于进化多目标优化的无监督机器学习”(项目编号：60905025)的研究成果之一。 |
|
Corresponding Authors:
Ma Chao
E-mail: buptmc@163.com
|
| ［1］ 翟东升,刘晨,欧阳轶慧.专利信息获取分析系统设计与实现［J］.现代图书情报技术,2009(5):55-60.
［2］ 王建冬,王继民,田飞佳.博客圈的特征及其演化机制初探［J］.现代图书情报技术,2008(4):56-60.
［3］ 王建冬,孙慧明.基于网站链接分析的“211”高校排名实证研究［J］.现代图书情报技术,2008(9):64-69.
［4］ Ye Q,Wu B,Wang B.JSNVA:A Java Straight-line Drawing Framework for Network Visual Analysis［C］.In: Proceedings of the 4th International Conference on Advanced Data Mining and Applications, Chengdu，China.2008: 667-674.
［5］ Eades P A. A Heuristic for Graph Drawing［J］. Congressus Numerantium, 1984,42:149–160.
［6］ Fruchterman T M J, Reingold E M. Graph Drawing by Force-directed Placement［J］. Software Practice and Experience, 1991, 21(11):1129–1164.
［7］ Yee K P, Fishe D, Dhamija R, et al. Animated Exploration of Dynamic Graphs with Radial Layout［C］. In: Proceedings of the IEEE Symposium on Information Visualization 2001. Washington, D.C.: IEEE Symposium, 2001: 43-51.
［8］ Newman M E J, Girvan M. Finding and Evaluating Community Structure in Networks［J］. Physical Review E, 2004, 69（2）: 026113.
［9］ Clauset A, Newman M E J, Moore C. Finding Community Structure in Very Large Networks［J］. Physical Review E, 2004, 70(6):066111.
［10］ Dongen S V. Graph Clustering via a Discrete Uncoupling Process［J］. Siam Journal on Matrix Analysis and Applications, 2008, 30(1):121-141.
［11］ Raghavan N U, Albert R, Kumara S. Near Linear Time Algorithm to Detect Community Structures in Large-scale Networks［J］. Physical Review E,2008, 76(3):036106.
［12］ Blondel V D, Guillaume J L, Lambiotte R,et al. Fast Unfolding of Communities in Large Networks［J］. Journal of Statistical Mechanics: Theory and Experiment, 2008(10): 10008.
［13］ Palla G, Derenyi I, Farkas I, et al. Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society［J］. Nature, 2005, 435 (7043):814–818.
［14］ Bron C, Kerbosch J. Finding All Cliques of an Undirected Graph［J］. Communications of the ACM, 1973, 16(9): 575-577.
［15］ Danon L, Díaz-Guilera A, Duch J,et al. Comparing Community Structure Identification［J］. Journal of Statistical Mechanics: Theory and Experiment, 2005(9):09008.
［16］ Fortunato S. Community Detection in Graphs［J］. Physics Reports, 2010(486): 75-174.
［17］ Barnes J, Hut P. A Hierarchical O(nlogn) Force-calculational Algorithm［J］. Nature, 1986, 324(6096):446-449.
［18］ Heer J, Agrawala M. Software Design Patterns for Information Visualization［J］. IEEE Transactions on Visualization and Computer Graphics, 2006, 12(5):853-860. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
