检索结果-南通市图书馆

Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations

Visual Computing for Industry,Biomedicine,and Art 2021年第1期4卷 219-232页

作者： Michael Burch Kiet Bennema ten Brinke Adrien Castella Ghassen Karray Sebastiaan Peters Vasil Shteriyanov Rinse Vlasvinkel Eindhoven University of Technology 5600MB EindhovenThe Netherlands

The visualization of dynamic graphs is a challenging task owing to the various properties of the underlying relational data and the additional time-varying *** sparse and small graphs,the most efficient approach to such visualization is node-link diagrams,whereas for dense graphs with attached data,adjacency matrices might be the better *** graphs can contain both properties,being globally sparse and locally dense,a combination of several visual metaphors as well as static and dynamic visualizations is *** this paper,a visually and algorithmically scalable approach that provides views and perspectives on graphs as interactively linked node-link and adjacency matrix visualizations is *** the novelty of this technique,insights such as clusters or anomalies from one or several combined views can be used to influence the layout or reordering of the other ***,the importance of nodes and node groups can be detected,computed,and visualized by considering several layout and reordering properties in combination as well as different edge properties for the same set of *** an additional feature set,an automatic identification of groups,clusters,and outliers is provided over time,and based on the visual outcome of the node-link and matrix visualizations,the repertoire of the supported layout and matrix reordering techniques is extended,and more interaction techniques are provided when considering the dynamics of the graph ***,a small user experiment was conducted to investigate the usability of the proposed *** usefulness of the proposed tool is illustrated by applying it to a graph dataset,such as e co-authorships,co-citations,and a Comprehensible Perl Archive Network distribution.

关键词： Dynamic graph visualization node-link diagrams Adjacency matrices Layouts Reorderings

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Exploring the limits of complexity: A survey of empirical studies on graph visualisation

引用

Visual Informatics 2018年第4期2卷 264-282页

作者： Vahan Yoghourdjian Daniel Archambault Stephan Diehl Tim Dwyer Karsten Klein Helen C.Purchase Hsiang-Yun Wu Monash University Australia Swansea University United Kingdom University of Trier Germany University of Konstanz Germany University of Glasgow United Kingdom University of TU Wien Austria

For decades,researchers in information visualisation and graph drawing have focused on developing techniques for the layout and display of very large and complex *** involving human participants have also explored the readability of different styles of layout and representations for such *** both bodies of literature,networks are frequently referred to as being‘large’or‘complex’,yet these terms are *** a human-centred,experiment point-of-view,what constitutes‘large’(for example)depends on several factors,such as data complexity,visual complexity,and the technology *** this paper,we survey the literature on human-centred experiments to understand how,in practice,different features and characteristics of node–link diagrams affect visual complexity.

关键词： Graph visualisation Network visualisation node-link diagrams Cognitive scalability Evaluations Empirical studies

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Simplifying social networks via triangle-based cohesive subgraphs

引用

Visual Informatics 2023年第4期7卷 84-94页

作者： Rusheng Pan Yunhai Wang Jiashun Sun Hongbo Liu Ying Zhao Jiazhi Xia Wei Chen State Key Lab of CAD&CG Zhejiang UniversityHangzhou China School of Computer Science and Technology Shandong UniversityQingdaoChina School of Computer Science and Engineering Central South UniversityChangshaChina

One main challenge for simplifying node-link diagrams of large-scale social networks lies in that simplified graphs generally contain dense subgroups or cohesive *** triangles quantify the solid and stable relationships that maintain cohesive *** the mechanism of triangles within cohesive subgraphs contributes to illuminating patterns of connections within social ***,prior works can hardly handle and visualize triangles in cohesive *** this paper,we propose a triangle-based graph simplification approach that can filter and visualize cohesive subgraphs by leveraging a triangle-connectivity called k-truss and a force-directed *** design and implement TriGraph,a web-based visual interface that provides detailed information for exploring and analyzing social *** comparisons with existing methods,two case studies on real-world datasets,and feedback from domain experts demonstrate the effectiveness of TriGraph.

关键词： Graph simplification Cohesive subgraphs Graph triangle Graph layout node-link diagrams

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

SideKnot:Edge Bundling for Uncovering Relation Patterns in Graphs

引用

Tsinghua Science and Technology 2012年第4期17卷 399-408页

作者： Dichao Peng Neng Lu Guangyu Chen Wuheng Zuo Wei Chen Qunsheng Peng State Key Lab of CAD&CG Zhejiang UniversityHangzhou 310054China Zhijiang College of Zhejiang University of Technology Hangzhou 310024China

The node-link diagram is an intuitive way to depict a graph and present relationships between entities. Addressing the visual clutter induced by edge crossing and node-edge overlapping is a challenging task as the size of graph outgrows the visualization space. Many edge bundling methods are proposed to disclose high-level edge patterns. Though previous methods can successfully reveal the skeleton graph structure, the relation patterns at the individual node level can be overlooked. In addition, most edge bundling algorithms are computationally complex, which prevents them from scaling up for extremely large graphs. In this article, we extend SideKnot, an efficient edge bundling method to cluster and knot edges at the node side. Our proposed method is light, runs faster than most existing algorithms, and can reveal the relation patterns at the individual node level. Our results show that SideKnot can disclose a node＇s standing in the graph as well as the directional connection patterns to its peers.

关键词： graph visualization node-link diagrams edge bundling

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：