Please wait a minute...
New Technology of Library and Information Service  2010, Vol. 26 Issue (6): 60-65    DOI: 10.11925/infotech.1003-3513.2010.06.10
article Current Issue | Archive | Adv Search |
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)
Download: PDF(1301 KB)   HTML  
Export: BibTeX | EndNote (RIS)      

 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.

Key wordsComplex networks      Visual analytics      Social network analysis      Community      Dynamic link analysis     
Received: 28 April 2010      Published: 26 July 2010




Corresponding Authors: Ma Chao     E-mail:

Cite this article:

Ma Chao Ye Qi Wu Bin Shi Chuan She Ying. Design and Implementation of a Visual Analytical Platform for Dynamic Link Analysis. New Technology of Library and Information Service, 2010, 26(6): 60-65.

URL:     OR

[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.

[1] Liqing Qiu,Wei Jia,Xin Fan. Influence Maximization Algorithm Based on Overlapping Community[J]. 数据分析与知识发现, 2019, 3(7): 94-102.
[2] Ming Yi,Tingting Zhang. Ranking Answer Quality of Popular Q&A Community[J]. 数据分析与知识发现, 2019, 3(6): 12-20.
[3] Xiaolan Wu,Chengzhi Zhang. Analysis of Knowledge Flow Based on Academic Social Networks:
A Case Study of
[J]. 数据分析与知识发现, 2019, 3(4): 107-116.
[4] Quan Lu,Anqi Zhu,Jiyue Zhang,Jing Chen. Research on User Information Requirement in Chinese Network Health Community: Taking Tumor-forum Data of Qiuyi as an Example[J]. 数据分析与知识发现, 2019, 3(4): 22-32.
[5] Xiwei Wang,Duo Wang,Qingxiao Zheng,Ya’nan Wei. Information Interaction Between User and Enterprise in Online Brand Community: A Study of Virtual Reality Industry[J]. 数据分析与知识发现, 2019, 3(3): 83-94.
[6] He Li,Linlin Zhu,Min Yan,Jincheng Liu,Chuang Hong. Identifying Useful Information from Open Innovation Community[J]. 数据分析与知识发现, 2018, 2(12): 12-22.
[7] Xiufeng Cheng,Xinyi Zhang,Ning Wang. Identifying Trending Topics in Q&A Community with CART Decision Tree[J]. 数据分析与知识发现, 2018, 2(12): 52-59.
[8] Fen Chen,Xi Fu,Yuan He,Chunxiang Xue. Identifying Weibo Opinion Leaders with Social Network Analysis and Influence Diffusion Model[J]. 数据分析与知识发现, 2018, 2(12): 60-67.
[9] Zhongyi Wang,Heming Zhang,Jing Huang,Chunya Li. Studying Knowledge Dissemination of Online Q&A Community with Social Network Analysis[J]. 数据分析与知识发现, 2018, 2(11): 80-94.
[10] Yunwei Chen,Ruihong Zhang. Comparing on Community Detection Algorithms for Information Mining[J]. 数据分析与知识发现, 2018, 2(10): 84-94.
[11] Xiaohua Shi,Hongtao Lu. Detecting Community in Scientific Collaboration Network with Bayesian Symmetric NMF[J]. 数据分析与知识发现, 2017, 1(9): 49-56.
[12] Fei Li,Jian Zhang,Zongshui Wang. Review of Social Recommendation with Bibliometrics and Social Network Analysis[J]. 数据分析与知识发现, 2017, 1(6): 22-35.
[13] Xiwei Wang,Liu Zhang,Shimeng Li,Nan’axue Wang. The Dissemination of Online Public Opinion on Social Welfare Issues via New Media: Case Study of “Draw up the Lifeline” in Sina Weibo[J]. 数据分析与知识发现, 2017, 1(6): 93-101.
[14] Yaxian Qing,Rui Li,Huayi Wu. Analyzing Academic Community Based on Co-author Network[J]. 数据分析与知识发现, 2017, 1(4): 20-29.
[15] Ruxia Fan,Jianxun Zeng,Yaruixi Gao. Recognizing Dynamic Academic Impacts of Scholars Based on Cooperative Network[J]. 数据分析与知识发现, 2017, 1(4): 30-37.
  Copyright © 2016 Data Analysis and Knowledge Discovery   Tel/Fax:(010)82626611-6626,82624938