Adaptive Visualization of Networked Graphs Based on Force-Directed Algorithms

摘要：

　　The visualization of networked graphs has always been an important concern in the field of visualization.Among many of networked visualization algorithms, the force-directed algorithms are of most implemental flexibility, natural simplicity, conceptual intuitiveness and visual elegance.Grounded in the physical concepts of spring force and electric repulsion, the force-directed algorithms compute the graphic layout adaptively according to the structure of the graph, without extra domain knowledge.For the end of effective visualization of semantically networked knowledge units extracted from domain-specific textual corpora, the present paper designs and realizes an improved force-directed algorithm, taking into account the semantic distances between and the weights of the knowledge units.Given 20 latent knowledge units concerning wind energy and their covariance matrix, generated from Correlated Topic Model (CTM) processing, the visualizing outcome based on covariance distances between each pair of topic units proves the effectiveness of the proposed algorithm.

关键词： visualization computer graphics force-directed algorithm network graphics semantic distance

作者: FAN Jialin CHEN Kun CEN Yonghua

作者单位: Department of Information Management, School of Economics and Management, NJUST, Nanjing 210094, China

会议类型: 国际会议

会议名称: 第一届信息获取与知识服务国际会议暨第六届搜索行为与用户认知研讨会

会议地点: 武汉

会议语种:英文

页码: 147-151

在线出版日期: 2014-10-10（万方平台首次上网日期，不代表论文的发表时间）